BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
on the
Google on the

Tag #on the

3242 papers:

PADLPADL-2020-ElsmanH #garbage collection #memory management #ml
On the Effects of Integrating Region-Based Memory Management and Generational Garbage Collection in ML (ME, NH), pp. 95–112.
PADLPADL-2020-NguyenPS #web #web service #workflow
On Repairing Web Services Workflows (THN, EP, TCS), pp. 37–53.
CSLCSL-2020-Adamek #algebra
On Free Completely Iterative Algebras (JA), p. 21.
CSLCSL-2020-HoelzelW #higher-order #logic #semantics
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics (MH, RW), p. 16.
ICSAICSA-2019-WohlrabPKH #agile #architecture #case study #interface
On Interfaces to Support Agile Architecting in Automotive: An Exploratory Case Study (RW, PP, EK, RH), pp. 161–170.
ICPCICPC-2019-AlrubayeM0 #detection #information retrieval #java #library #migration #using
On the use of information retrieval to automate the detection of third-party Java library migration at the method level (HA, MWM, AO0), pp. 347–357.
MSRMSR-2019-SerraGPFGB #automation #effectiveness #generative #testing #years after
On the effectiveness of manual and automatic unit test generation: ten years later (DS, GG, FP, FF, HCG, AB), pp. 121–125.
SANERSANER-2019-0008NBL #refactoring
On the Impact of Refactoring Operations on Code Naturalness (BL0, CN0, GB, ML), pp. 594–598.
SANERSANER-2019-Farmahinifarahani #clone detection #detection #precise #tool support
On Precision of Code Clone Detection Tools (FF, VS, DY, HS, CVL), pp. 84–94.
SANERSANER-2019-ZeroualiCMRG #image #javascript
On the Impact of Outdated and Vulnerable Javascript Packages in Docker Images (AZ, VC, TM, GR, JMGB), pp. 619–623.
SANERSANER-2019-ZeroualiMRG #debugging
On the Relation between Outdated Docker Containers, Severity Vulnerabilities, and Bugs (AZ, TM, GR, JMGB), pp. 491–501.
SANERSANER-2019-ZeroualiMRG19a #empirical #metric
On the Diversity of Software Package Popularity Metrics: An Empirical Study of npm (AZ, TM, GR, JMGB), pp. 589–593.
SCAMSCAM-2019-00080BML #identifier #quality
On the Quality of Identifiers in Test Code (BL0, CN0, GB, AM, ML), pp. 204–215.
SCAMSCAM-2019-Kessel019a #behaviour #comparison #equivalence #functional
On the Efficacy of Dynamic Behavior Comparison for Judging Functional Equivalence (MK, CA0), pp. 193–203.
DLTDLT-2019-AmbrozP #sequence
On Palindromic Length of Sturmian Sequences (PA, EP), pp. 244–250.
DLTDLT-2019-BhaveKPT #bound #context-sensitive grammar
On Timed Scope-Bounded Context-Sensitive Languages (DB, SNK, RP, AT0), pp. 168–181.
DLTDLT-2019-DobronravovDO #automaton #finite #string
On the Length of Shortest Strings Accepted by Two-Way Finite Automata (ED, ND, AO), pp. 88–99.
DLTDLT-2019-MrazO #automaton
On Shrinking Restarting Automata of Window Size One and Two (FM, FO), pp. 140–153.
FMFM-2019-BoerB #execution #symbolic computation
On the Nature of Symbolic Execution (FSdB, MMB), pp. 64–80.
FSCDFSCD-2019-LagoL #probability #λ-calculus
On the Taylor Expansion of Probabilistic lambda-terms (UDL, TL), p. 16.
AIIDEAIIDE-2019-GaoKHT #case study #learning
On Hard Exploration for Reinforcement Learning: A Case Study in Pommerman (CG, BK, PHL, MET), pp. 24–30.
CoGCoG-2019-MarengoLB #artificial reality #simulation
On the Influence of the Supine Posture on Simulation Sickness in Virtual Reality (JM, PL, RB), pp. 1–8.
CoGCoG-2019-VolzN #analysis #game studies #simulation
On the Effects of Simulating Human Decisions in Game Analysis (VV, BN), pp. 1–8.
DiGRADiGRA-2019-Gualeni
On the de-familiarizing and re-ontologizing effects of glitches and glitch-alikes (SG).
CIKMCIKM-2019-0003RMMD
On Transforming Relevance Scales (LH0, KR, EM, SM, GD), pp. 39–48.
CIKMCIKM-2019-GalitskyI
On a Chatbot Conducting Virtual Dialogues (BG, DII), pp. 2925–2928.
CIKMCIKM-2019-KoLLLY #query
On VR Spatial Query for Dual Entangled Worlds (SHK, YCL, HCL, WCL, DNY), pp. 9–18.
CIKMCIKM-2019-LiMB0G #adaptation #framework #novel #recognition
On Novel Object Recognition: A Unified Framework for Discriminability and Adaptability (KL0, MRM, BB, YF0, HPG), pp. 2265–2268.
CIKMCIKM-2019-WangGLML #bias #testing
On Heavy-user Bias in A/B Testing (YW, SG, JL, AM, SL), pp. 2425–2428.
CIKMCIKM-2019-ZhangG0G #evolution #graph
On Continuously Matching of Evolving Graph Patterns (QZ, DG, XZ0, AG), pp. 2237–2240.
ECIRECIR-p1-2019-DonnellyR #analysis #sentiment
On Interpretability and Feature Representations: An Analysis of the Sentiment Neuron (JD, AR), pp. 795–802.
ECIRECIR-p1-2019-ManotumruksaRMO #recommendation
On Cross-Domain Transfer in Venue Recommendation (JM, DR, CM, IO), pp. 443–456.
ECIRECIR-p2-2019-YafayA #query
On the Impact of Storing Query Frequency History for Search Engine Result Caching (EY, ISA), pp. 155–162.
ICMLICML-2019-0002CZG #adaptation #invariant #learning
On Learning Invariant Representations for Domain Adaptation (HZ0, RTdC, KZ0, GJG), pp. 7523–7532.
ICMLICML-2019-CharoenphakdeeL #learning #symmetry
On Symmetric Losses for Learning from Corrupted Labels (NC, JL, MS), pp. 961–970.
ICMLICML-2019-ClemenconLB #random
On Medians of (Randomized) Pairwise Means (SC, PL, PB), pp. 1272–1281.
ICMLICML-2019-EtmannLMS #robust
On the Connection Between Adversarial Robustness and Saliency Map Interpretability (CE, SL, PM, CS), pp. 1823–1832.
ICMLICML-2019-FrancP #learning #nondeterminism #predict
On discriminative learning of prediction uncertainty (VF, DP), pp. 1963–1971.
ICMLICML-2019-HacohenW #education #learning #network #power of
On The Power of Curriculum Learning in Training Deep Networks (GH, DW), pp. 2535–2544.
ICMLICML-2019-HayouDR #network
On the Impact of the Activation function on Deep Neural Networks Training (SH, AD, JR), pp. 2672–2680.
ICMLICML-2019-HeidariNG #algorithm #learning #policy #social
On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning (HH, VN, KPG), pp. 2692–2701.
ICMLICML-2019-KroshninTDDGU #approximate #complexity
On the Complexity of Approximating Wasserstein Barycenters (AK, NT, DD, PED, AG, CAU), pp. 3530–3540.
ICMLICML-2019-LinHJ #algorithm #analysis #performance
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms (TL, NH, MIJ), pp. 3982–3991.
ICMLICML-2019-LiuTC #bound
On Certifying Non-Uniform Bounds against Adversarial Attacks (CL, RT, VC), pp. 4072–4081.
ICMLICML-2019-MaronFSL #invariant #network
On the Universality of Invariant Networks (HM, EF, NS, YL), pp. 4363–4371.
ICMLICML-2019-MianjyA
On Dropout and Nuclear Norm Regularization (PM, RA), pp. 4575–4584.
ICMLICML-2019-Nguyen #learning #set
On Connected Sublevel Sets in Deep Learning (QN), pp. 4790–4799.
ICMLICML-2019-PooleOOAT #bound
On Variational Bounds of Mutual Information (BP, SO, AvdO, AA, GT), pp. 5171–5180.
ICMLICML-2019-RahamanBADLHBC #bias #network
On the Spectral Bias of Neural Networks (NR, AB, DA, FD, ML, FAH, YB, ACC), pp. 5301–5310.
ICMLICML-2019-ShahGAD #bias #learning
On the Feasibility of Learning, Rather than Assuming, Human Biases for Reward Inference (RS, NG, PA, ADD), pp. 5670–5679.
ICMLICML-2019-VlassisBDJ #design #evaluation
On the Design of Estimators for Bandit Off-Policy Evaluation (NV, AB, MD, TJ), pp. 6468–6476.
ICMLICML-2019-WagstaffFEPO #representation #set
On the Limitations of Representing Functions on Sets (EW, FF, ME, IP, MAO), pp. 6487–6494.
ICMLICML-2019-Wang019a #difference #linear #privacy
On Sparse Linear Regression in the Local Differential Privacy Model (DW, JX0), pp. 6628–6637.
ICMLICML-2019-WangM0YZG #convergence #robust
On the Convergence and Robustness of Adversarial Training (YW0, XM, JB0, JY, BZ, QG), pp. 6586–6595.
ICMLICML-2019-WangZXS #learning
On the Generalization Gap in Reparameterizable Reinforcement Learning (HW, SZ, CX, RS), pp. 6648–6658.
ICMLICML-2019-WeiYW #generative #modelling #statistics
On the statistical rate of nonlinear recovery in generative models with heavy-tailed data (XW, ZY, ZW), pp. 6697–6706.
ICMLICML-2019-XieCJZZ #performance #scalability
On Scalable and Efficient Computation of Large Scale Optimal Transport (YX, MC, HJ, TZ, HZ), pp. 6882–6892.
ICMLICML-2019-YuJ #communication #complexity #optimisation #parallel #probability
On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic Non-Convex Optimization (HY, RJ), pp. 7174–7183.
ICMLICML-2019-YuJY #analysis #communication #distributed #linear #optimisation #performance
On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization (HY, RJ, SY), pp. 7184–7193.
KDDKDD-2019-ChenBF #modelling #network
On Dynamic Network Models and Application to Causal Impact (YCC, ASB, JLF), pp. 1194–1204.
ECOOPECOOP-2019-MisonizhnikM #satisfiability #type system
On Satisfiability of Nominal Subtyping with Variance (AM, DM), p. 20.
OOPSLAOOPSLA-2019-BiswasE #complexity #consistency #transaction
On the complexity of checking transactional consistency (RB, CE), p. 28.
OOPSLAOOPSLA-2019-GoelV #design #implementation #lazy evaluation #using
On the design, implementation, and use of laziness in R (AG, JV), p. 27.
OOPSLAOOPSLA-2019-MiltnerGLLRSTU #on the fly #synthesis
On the fly synthesis of edit suggestions (AM, SG, VL, AL, AR, GS, AT0, AU), p. 29.
POPLPOPL-2019-RaadDRLV #concurrent #consistency #correctness #declarative #library #memory management #modelling #specification #verification
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models (AR, MD, LR, OL, VV), p. 31.
SASSAS-2019-FijalkowLOOP0 #abstract interpretation #problem
On the Monniaux Problem in Abstract Interpretation (NF, EL, PO, JO, AP, JW0), pp. 162–180.
ESEC-FSEESEC-FSE-2019-Fu #analysis #distributed #scalability
On the scalable dynamic taint analysis for distributed systems (XF), pp. 1247–1249.
ESEC-FSEESEC-FSE-2019-FucciMM #api #documentation #identification #machine learning #using
On using machine learning to identify knowledge in API reference documentation (DF, AM, WM), pp. 109–119.
ESEC-FSEESEC-FSE-2019-Greiner #model transformation #product line #reuse
On extending single-variant model transformations for reuse in software product line engineering (SG), pp. 1160–1163.
ESEC-FSEESEC-FSE-2019-SangleM #open source #python #using
On the use of lambda expressions in 760 open source Python projects (SS, SM), pp. 1232–1234.
ICSE-2019-LeB00LP #assessment #correctness #reliability
On reliability of patch correctness assessment (XBDL, LB, DL0, XX0, SL, CSP), pp. 524–535.
ICSE-2019-TufanoPWBP #learning
On learning meaningful code changes via neural machine translation (MT, JP, CW, GB, DP), pp. 25–36.
CASECASE-2019-CaiGS #consistency #reduction
On Consistent Reduction in Discrete-Event Systems (KC, AG, CS), pp. 474–479.
CASECASE-2019-RoselliHRFA #equivalence #using
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering (SFR, FH, SR, MF, KÅ), pp. 1004–1009.
CASECASE-2019-SchlotzhauerKWB #2d #collaboration #metric #safety
On the trustability of the safety measures of collaborative robots: 2D Collision-force-map of a sensitive manipulator for safe HRC (AS, LK, JW, MB, MWH), pp. 1676–1683.
CASECASE-2019-ShinLM #assembly #optimisation #parallel
On the Optimization Of Cycle Time in Assembly Lines with Parallel Workstations and Tasks Requiring Multiple Workers (JS, ML, JRM), pp. 916–921.
CASECASE-2019-StappenD #3d
On Sufficient Numbers of Fingers to Immobilize 3D Chains of Polyhedra (AFvdS, MD), pp. 1443–1449.
ESOPESOP-2019-BuroM #multi
On the Multi-Language Construction (SB, IM), pp. 293–321.
CADECADE-2019-MeloO #finite
On the Width of Regular Classes of Finite Structures (AAdM, MdOO), pp. 18–34.
CADECADE-2019-PeuterS #invariant #parametricity #synthesis
On Invariant Synthesis for Parametric Systems (DP, VSS), pp. 385–405.
CAVCAV-2019-BiswasEE #complexity #consistency #data type
On the Complexity of Checking Consistency for Replicated Data Types (RB, ME, CE), pp. 324–343.
ICSTICST-2019-RwemalikaKPTL #evolution #keyword #testing
On the Evolution of Keyword-Driven Test Suites (RR, MK, MP, YLT, PL), pp. 335–345.
VMCAIVMCAI-2019-RaadLV #semantics
On the Semantics of Snapshot Isolation (AR, OL, VV), pp. 1–23.
ICPCICPC-2018-DoiHASK #automation #identification #question
On the naturalness of auto-generated code: can we identify auto-generated code automatically? (MD, YH, RA, KS, SK), pp. 340–343.
ICSMEICSME-2018-DecanMC #dependence #evolution #network
On the Evolution of Technical Lag in the npm Package Dependency Network (AD, TM, EC), pp. 404–414.
ICSMEICSME-2018-JimenezCTP #analysis #n-gram #parametricity
On the Impact of Tokenizer and Parameters on N-Gram Based Code Analysis (MJ, MC, YLT, MP), pp. 437–448.
ICSMEICSME-2018-LawrieB #debugging #locality
On the Value of Bug Reports for Retrieval-Based Bug Localization (DJL, DWB), pp. 524–528.
ICSMEICSME-2018-SaidQK #embedded #mining #state machine
On State Machine Mining from Embedded Control Software (WS, JQ, RK), pp. 138–148.
ICSMEICSME-2018-SpadiniPZBB #quality #smell
On the Relation of Test Smells to Software Code Quality (DS, FP, AZ, MB, AB), pp. 1–12.
MSRMSR-2018-DecanMC #dependence #network #security
On the impact of security vulnerabilities in the npm package dependency network (AD, TM, EC), pp. 181–191.
CIAACIAA-2018-Condon #algorithm #analysis #design #network
On Design and Analysis of Chemical Reaction Network Algorithms (AC), pp. 1–3.
CIAACIAA-2018-MoldagaliyevS0 #complexity
On the Values for Factor Complexity (BM, LS, FS0), pp. 274–285.
CIAACIAA-2018-SinghK #automaton #complexity
On Syntactic Complexity of Circular Semi-flower Automata (SNS, KVK), pp. 312–323.
DLTDLT-2018-CarpiD #commutative #context-free grammar #equivalence
On the Commutative Equivalence of Context-Free Languages (AC, FD), pp. 169–181.
DLTDLT-2018-DayFMNS
On Matching Generalised Repetitive Patterns (JDD, PF, FM, DN, MLS), pp. 269–281.
DLTDLT-2018-GonzeJ #automaton #reachability #set
On Completely Reachable Automata and Subset Reachability (FG, RMJ), pp. 330–341.
DLTDLT-2018-Gruber0W #finite #problem
On Minimal Grammar Problems for Finite Languages (HG, MH0, SW), pp. 342–353.
DLTDLT-2018-IbarraMR
On Counting Functions of Languages (OHI, IM, BR), pp. 429–440.
DLTDLT-2018-KarhumakiPW
On Abelian Subshifts (JK, SP, MAW), pp. 453–464.
DLTDLT-2018-LodingP #ambiguity #automaton
On Finitely Ambiguous Büchi Automata (CL, AP), pp. 503–515.
DLTDLT-2018-Otto #automaton #order
On Deterministic Ordered Restart-Delete Automata (FO), pp. 529–540.
FMFM-2018-KastnerMF #abstract interpretation #safety #security
On Software Safety, Security, and Abstract Interpretation (DK, LM, CF), pp. 662–665.
FSCDFSCD-2018-IkebuchiN
On Repetitive Right Application of B-Terms (MI, KN), p. 15.
IFM-2018-BasileBFGMPTF #formal method #industrial #overview
On the Industrial Uptake of Formal Methods in the Railway Domain - A Survey with Stakeholders (DB, MHtB, AF, SG, FM, AP, DT, AF), pp. 20–29.
DiGRADiGRA-2018-Bonner #game studies
On Striated Wilderness and Prospect Pacing: Rural Open World Games as Liminal Spaces of the Man-Nature Dichotomy (MB).
CoGVS-Games-2018-SajjadiHCK #experience #game studies #social
On the Effect of a Personality-Driven ECA on Perceived Social Presence and Game Experience in VR (PS, LH, PC, SK), pp. 1–8.
CIKMCIKM-2018-SarkarB0 #network
On Rich Clubs of Path-Based Centralities in Networks (SS, SB, AM0), pp. 567–576.
CIKMCIKM-2018-TangTDJG #detection #realtime
On Real-time Detecting Passenger Flow Anomalies (BT, HT, XD, BJ, TG), pp. 1053–1062.
CIKMCIKM-2018-Voorhees #reuse #using
On Building Fair and Reusable Test Collections using Bandit Techniques (EMV), pp. 407–416.
CIKMCIKM-2018-ZhaoX0ZLZ #approach #comprehension #learning #predict
On Prediction of User Destination by Sub-Trajectory Understanding: A Deep Learning based Approach (JZ, JX, RZ0, PZ, CL, FZ), pp. 1413–1422.
ECIRECIR-2018-MackenzieMSC #cost analysis
On the Cost of Negation for Dynamic Pruning (JM, CM, FS, JSC), pp. 544–549.
ECIRECIR-2018-SuFMMO #classification #multi #twitter
On Refining Twitter Lists as Ground Truth Data for Multi-community User Classification (TS, AF, RM, CM, IO), pp. 765–772.
ECIRECIR-2018-YangOMMF #linear #word
On the Reproducibility and Generalisation of the Linear Transformation of Word Embeddings (XY0, IO, RM, CM, AF), pp. 263–275.
ICMLICML-2018-0001MPS #approximate #first-order
On the Limitations of First-Order Approximation in GAN Dynamics (JL0, AM, JP, LS), pp. 3011–3019.
ICMLICML-2018-AroraCH #network #optimisation
On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization (SA, NC, EH), pp. 244–253.
ICMLICML-2018-ChatterjiFMBJ #formal method #monte carlo #probability #reduction
On the Theory of Variance Reduction for Stochastic Gradient Monte Carlo (NSC, NF, YAM, PLB, MIJ), pp. 763–772.
ICMLICML-2018-CohenDO
On Acceleration with Noise-Corrupted Gradients (MC0, JD, LO), pp. 1018–1027.
ICMLICML-2018-DuL #network #polynomial #power of
On the Power of Over-parametrization in Neural Networks with Quadratic Activation (SSD, JDL), pp. 1328–1337.
ICMLICML-2018-KondorT #network
On the Generalization of Equivariance and Convolution in Neural Networks to the Action of Compact Groups (RK, ST), pp. 2752–2760.
ICMLICML-2018-LiaoC #random
On the Spectrum of Random Features Maps of High Dimensional Data (ZL, RC), pp. 3069–3077.
ICMLICML-2018-LocatelloRKRSSJ #coordination
On Matching Pursuit and Coordinate Descent (FL, AR, SPK, GR, BS, SUS, MJ), pp. 3204–3213.
ICMLICML-2018-MianjyAV #bias
On the Implicit Bias of Dropout (PM, RA, RV), pp. 3537–3545.
ICMLICML-2018-MussmannL #fault #nondeterminism #performance
On the Relationship between Data Efficiency and Error for Uncertainty Sampling (SM, PL), pp. 3671–3679.
ICMLICML-2018-NguyenSH #learning
On Learning Sparsely Used Dictionaries from Incomplete Samples (TVN, AS, CH), pp. 3766–3775.
ICMLICML-2018-RainforthCYW #monte carlo
On Nesting Monte Carlo Estimators (TR, RC, HY, AW), pp. 4264–4273.
ICPRICPR-2018-LiangLTZ0 #recognition
On Mugshot-based Arbitrary View Face Recognition (JL, FL0, HT, QZ, AKJ0), pp. 3126–3131.
KDDKDD-2018-LiuHLH #induction #network #taxonomy
On Interpretation of Network Embedding via Taxonomy Induction (NL, XH, JL, XH), pp. 1812–1820.
KDDKDD-2018-Teh #big data #learning #problem
On Big Data Learning for Small Data Problems (YWT), p. 3.
KDDKDD-2018-WuZW #graph #using
On Discrimination Discovery and Removal in Ranked Data using Causal Graph (YW, LZ0, XW), pp. 2536–2544.
KDDKDD-2018-ZhangLDFY #generative
On the Generative Discovery of Structured Medical Knowledge (CZ, YL, ND, WF0, PSY), pp. 2720–2728.
ECMFAECMFA-2018-HinkelB #analysis #design #metamodelling
On the Influence of Metamodel Design to Analyses and Transformations (GH, EB), pp. 63–79.
MoDELSMoDELS-2018-GuerraL #flexibility #modelling
On the Quest for Flexible Modelling (EG, JdL), pp. 23–33.
MoDELSMoDELS-2018-KautzR
On Computing Instructions to Repair Failed Model Refinements (OK, BR), pp. 289–299.
OnwardOnward-2018-AlexandruMPPGR
On the usage of pythonic idioms (CVA, JJM, SP, SP, HCG, GR), pp. 1–11.
AdaEuropeAdaEurope-2018-GarridoZAP #ada #policy
On the Effect of Protected Entry Servicing Policies on the Response Time of Ada Tasks (JG, JZ, AA0, JAdlP), pp. 73–86.
PADLPADL-2018-Tarau #λ-calculus
On k-colored Lambda Terms and Their Skeletons (PT), pp. 116–131.
PEPMPEPM-2018-GreenmanM #cost analysis
On the cost of type-tag soundness (BG, ZM), pp. 30–39.
POPLPOPL-2018-Lee0A #automation #correctness #implementation #proving
On automatically proving the correctness of math.h implementations (WL0, RS0, AA), p. 32.
PPDPPPDP-2018-BreuvartL #probability #λ-calculus
On Intersection Types and Probabilistic Lambda Calculi (FB, UDL), p. 13.
ASEASE-2018-HabchiBR #android #performance
On adopting linters to deal with performance concerns in Android apps (SH, XB0, RR), pp. 6–16.
ESEC-FSEESEC-FSE-2018-Gusmanov #modelling #network #reliability
On the adoption of neural networks in modeling software reliability (KG), pp. 962–964.
ESEC-FSEESEC-FSE-2018-HellendoornDA #proving
On the naturalness of proofs (VJH, PTD, MAA), pp. 724–728.
ICSE-2018-BellerSSZ #behaviour #debugging
On the dichotomy of debugging behavior among programmers (MB, NS, DS, AZ), pp. 572–583.
ICSE-2018-HabayebMMB #debugging #markov #predict #using
On the use of hidden Markov model to predict the time to fix bugs (MH, SSM, AVM, ABB), p. 700.
ICSE-2018-PalombaBPFOL #empirical #maintenance #scalability #smell
On the diffuseness and the impact on maintainability of code smells: a large scale empirical investigation (FP, GB, MDP, FF, RO, ADL), p. 482.
CASECASE-2018-TaoYTL #adaptation #design #flexibility #fuzzy
On the Design of Fuzzy Adaptive State Estimator for a Flexible Air-breathing Hypersonic Vehicle (XT, JY, XT, ZL0), pp. 104–109.
CASECASE-2018-WuJX #coordination #distributed #energy #optimisation #physics
On Distributed Optimization for Supply Demand Coordination in Cyber Physical Energy Systems (JW, QSJ, ZX), pp. 553–558.
CASECASE-2018-YangH #graph #multi
On a class of multi-input laplacian controllable graphs (PYY, SPH), pp. 310–315.
ESOPESOP-2018-RaadLV #consistency #parallel
On Parallel Snapshot Isolation and Release/Acquire Consistency (AR, OL, VV), pp. 940–967.
ESOPESOP-2018-ToninhoY #encoding #polymorphism
On Polymorphic Sessions and Functions - A Tale of Two (Fully Abstract) Encodings (BT, NY), pp. 827–855.
CAVCAV-2018-BouajjaniEJQ #bound #message passing #source code #verification
On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony (AB, CE, KJ, SQ), pp. 372–391.
CSLCSL-2018-McCuskerS #composition
On Compositionality of Dinatural Transformations (GM, AS), p. 22.
VMCAIVMCAI-2018-DongolJRA #abstraction #composition
On abstraction and compositionality for weak-memory linearisability (BD, RJ, JR, AA), pp. 183–204.
VMCAIVMCAI-2018-Ranzato
On Constructivity of Galois Connections (FR), pp. 452–473.
ECSAECSA-2017-ZalewskiBR #architecture #bias
On Cognitive Biases in Architecture Decision Making (AZ, KB, AR), pp. 123–137.
ICSAICSA-2017-CzepaTZKWR #architecture #behaviour #constraints #empirical #semantics
On the Understandability of Semantic Constraints for Behavioral Software Architecture Compliance: A Controlled Experiment (CC, HT, UZ, TTTK, EW, CR), pp. 155–164.
ICSAICSA-2017-KugeleOBCTH
On Service-Orientation for Automotive Software (SK, PO, MB, OC, MT, WH), pp. 193–202.
JCDLJCDL-2017-ElekesSB #modelling #semantics #similarity #word
On the Various Semantics of Similarity in Word Embedding Models (AE, MS, KB), pp. 139–148.
CSEETCSEET-2017-RupakhetiHMCS #requirements
On a Pursuit for Perfecting an Undergraduate Requirements Engineering Course (CRR, MH, SM, SC, AS), pp. 97–106.
EDMEDM-2017-BaoCH #learning #multi #online
On the Prevalence of Multiple-Account Cheating in Massive Open Online Learning (YB, GC, CH).
EDMEDM-2017-LalleCATM #learning #self #student
On the Influence on Learning of Student Compliance with Prompts Fostering Self-Regulated Learning (SL, CC, RA, MT, NM).
ICPCICPC-2017-LinPMBL
On the uniqueness of code redundancies (BL0, LP, AM, GB, ML), pp. 121–131.
ICPCICPC-2017-ValeM #assessment #design
On the properties of design-relevant classes for design anomaly assessment (LdNV, MdAM), pp. 332–335.
ICSMEICSME-2017-BaumSB #order #overview #perspective #source code
On the Optimal Order of Reading Source Code Changes for Review (TB, KS, AB), pp. 329–340.
MSRMSR-2017-OrellanaLMD #dataset #difference #integration #testing
On the differences between unit and integration testing in the travistorrent dataset (GO, GL, AM, SD), pp. 451–454.
MSRMSR-2017-PaixaoFDM #integration #non-functional #requirements
On the interplay between non-functional requirements and builds on continuous integration (KVRP, CZF, FMD, MdAM), pp. 479–482.
SANERSANER-2017-OsmanCSGN #evolution #exception #java
On the evolution of exception usage in Java projects (HO, AC, JS, MG, ON), pp. 422–426.
SCAMSCAM-2017-RahmanR #empirical
On the Relationships Between Stability and Bug-Proneness of Code Clones: An Empirical Study (MSR0, CKR), pp. 131–140.
AFLAFL-2017-BeierHK #complexity #linear #set
On the Descriptional Complexity of Operations on Semilinear Sets (SB, MH, MK), pp. 41–55.
AFLAFL-2017-PlatekO #automaton
On h-Lexicalized Restarting Automata (MP, FO), pp. 219–233.
CIAACIAA-2017-AcetoAFIK #complexity #monitoring
On the Complexity of Determinizing Monitors (LA, AA, AF, AI, SÖK), pp. 1–13.
CIAACIAA-2017-BerglundMWW #regular expression #semantics
On the Semantics of Atomic Subgroups in Practical Regular Expressions (MB, BvdM, BWW, NW), pp. 14–26.
CIAACIAA-2017-BjorklundBE #graph #order
On the Regularity and Learnability of Ordered DAG Languages (HB, JB, PE), pp. 27–39.
CIAACIAA-2017-Bordihn0 #automaton #finite #nondeterminism
On the Number of Active States in Deterministic and Nondeterministic Finite Automata (HB, MH0), pp. 40–51.
CIAACIAA-2017-Massazza
On the Conjecture ℒDFCM ⊊ RCM (PM), pp. 175–187.
DLTDLT-2017-Beier0 #complexity #proving #regular expression
On Regular Expression Proof Complexity (SB, MH0), pp. 83–95.
DLTDLT-2017-Broda0MMR #automaton
On the Mother of All Automata: The Position Automaton (SB, MH0, EM, NM, RR), pp. 134–146.
DLTDLT-2017-GazdagT #power of
On the Power of Permitting Semi-conditional Grammars (ZG, KT), pp. 173–184.
DLTDLT-2017-GonzeGGJV
On the Interplay Between Babai and Černý's Conjectures (FG, VVG, BG, RMJ, MVV), pp. 185–197.
DLTDLT-2017-HospodarJM #complexity
On the Descriptive Complexity of Σ∗L (MH, GJ, PM), pp. 222–234.
DLTDLT-2017-PetrovaS #word
On the Tree of Binary Cube-Free Words (EAP, AMS), pp. 296–307.
DLTDLT-2017-RubtsovV #automaton #complexity #set
On Computational Complexity of Set Automata (AAR, MNV), pp. 332–344.
DLTDLT-2017-Rukavicka #word
On the Number of Rich Words (JR), pp. 345–352.
FSCDFSCD-2017-Pistone #modelling
On Dinaturality, Typability and beta-eta-Stable Models (PP), p. 17.
SEFMSEFM-2017-PolaSB #approximate #metric
On Approximate Diagnosability of Metric Systems (GP, EDS, MDDB), pp. 269–283.
SEFMSEFM-2017-SantosR #constraints #runtime #workflow
On Run-Time Enforcement of Authorization Constraints in Security-Sensitive Workflows (DRdS, SR), pp. 203–218.
ICFP-2017-0002KLP #monad #power of
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control (YF0, OK, SL, MP), p. 29.
ICFP-2017-IgarashiSI #polymorphism #type system
On polymorphic gradual typing (YI, TS, AI), p. 29.
FDGFDG-2017-Abuzuraiq #clustering #constraints #generative #graph #morphism #using
On using graph partitioning with isomorphism constraint in procedural content generation (AMA), p. 10.
CIKMCIKM-2017-Duong-TrungS #concept #documentation #topic
On Discovering the Number of Document Topics via Conceptual Latent Space (NDT, LST), pp. 2051–2054.
CIKMCIKM-2017-HuCHFL #graph #nondeterminism
On Embedding Uncertain Graphs (JH, RC, ZH0, YF, SL), pp. 157–166.
CIKMCIKM-2017-YanLWLZJZ #behaviour #video
On Migratory Behavior in Video Consumption (HY, THL, GW0, YL0, HZ0, DJ, BYZ), pp. 1109–1118.
ECIRECIR-2017-EsquivelAMCM
On the Long-Tail Entities in News (JE, DA, MMA, DC, SM), pp. 691–697.
ECIRECIR-2017-HafizogluKA #performance
On the Efficiency of Selective Search (FH, ECK, ISA), pp. 705–712.
ICMLICML-2017-BriolOCCG #kernel #problem
On the Sampling Problem for Kernel Quadrature (FXB, CJO, JC, WYC, MAG), pp. 586–595.
ICMLICML-2017-ChoiD
On Relaxing Determinism in Arithmetic Circuits (AC, AD), pp. 825–833.
ICMLICML-2017-ChowdhuryG #kernel #multi
On Kernelized Multi-armed Bandits (SRC, AG), pp. 844–853.
ICMLICML-2017-GentileLKKZE #clustering
On Context-Dependent Clustering of Bandits (CG, SL, PK, AK, GZ, EE), pp. 1253–1262.
ICMLICML-2017-GuoPSW #network
On Calibration of Modern Neural Networks (CG, GP, YS0, KQW), pp. 1321–1330.
ICMLICML-2017-KhannaEDGN #approximate #optimisation #rank
On Approximation Guarantees for Greedy Low Rank Optimization (RK, ERE, AGD, JG, SNN), pp. 1837–1846.
ICMLICML-2017-MaoSC #matrix #symmetry
On Mixed Memberships and Symmetric Nonnegative Matrix Factorizations (XM0, PS, DC), pp. 2324–2333.
ICMLICML-2017-RaghuPKGS #network #power of
On the Expressive Power of Deep Neural Networks (MR, BP, JMK, SG, JSD), pp. 2847–2854.
ICMLICML-2017-ShenL #complexity
On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit (JS0, PL0), pp. 3115–3124.
ICMLICML-2017-VorontsovTKP #dependence #learning #network #orthogonal
On orthogonality and learning recurrent networks with long term dependencies (EV, CT, SK, CP), pp. 3570–3578.
ICMLICML-2017-YangGKSFL #set
On The Projection Operator to A Three-view Cardinality Constrained Set (HY, SG, CK, DS, RF, JL0), pp. 3871–3880.
KDDKDD-2017-ChenSSH #collaboration
On Sampling Strategies for Neural Network-based Collaborative Filtering (TC0, YS, YS, LH), pp. 767–776.
KDDKDD-2017-ShenHYSLC #network #online #social
On Finding Socially Tenuous Groups for Online Social Networks (CYS, LHH, DNY, HHS, WCL, MSC), pp. 415–424.
MDEBX-2017-StevensG
On Ontologology (PS, JG), pp. 54–58.
ECMFAECMFA-2017-ArcegaFHC #feature model #modelling #runtime
On the Influence of Models at Run-Time Traces in Dynamic Feature Location (LA, JF, ØH, CC), pp. 90–105.
ECMFAECMFA-2017-GomezMBCDGKLT #case study #development #experience #modelling #scalability
On the Opportunities of Scalable Modeling Technologies: An Experience Report on Wind Turbines Control Applications Development (AG, XM, GB, JC, CD, AG, DSK, JdL, ST), pp. 300–315.
ECMFAECMFA-2017-Kraas #automation #uml
On the Automated Derivation of Domain-Specific UML Profiles (AK), pp. 3–19.
MoDELSMoDELS-2017-HidakaJT #model transformation #transformation language
On Additivity in Transformation Languages (SH, FJ, MT), pp. 23–33.
LOPSTRLOPSTR-2017-BodiniT #λ-calculus
On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms (OB, PT), pp. 252–268.
POPLPOPL-2017-BouajjaniEGH #consistency #verification
On verifying causal consistency (AB, CE, RG, JH), pp. 626–638.
POPLPOPL-2017-KobayashiLB #fixpoint #higher-order #logic #recursion
On the relationship between higher-order recursion schemes and higher-order fixpoint logic (NK0, ÉL, FB), pp. 246–259.
ESEC-FSEESEC-FSE-2017-AlrajehPN #forensics #requirements
On evidence preservation requirements for forensic-ready systems (DA, LP, BN), pp. 559–569.
ESEC-FSEESEC-FSE-2017-Ellmann #development #documentation #similarity
On the similarity of software development documentation (ME), pp. 1030–1033.
ESEC-FSEESEC-FSE-2017-ZhouCMW #kernel #linux #maintenance #scalability
On the scalability of Linux kernel maintainers' work (MZ, QC, AM, FW), pp. 27–37.
ICSE-2017-SayaghKA #fault
On cross-stack configuration errors (MS, NK, BA), pp. 255–265.
CASECASE-2017-ArboGG #industrial #predict
On model predictive path following and trajectory tracking for industrial robots (MHA, EIG, JTG), pp. 100–105.
CASECASE-2017-BoseHS
On the separation of a polyhedron from its single-part mold (PB, DH, SS), pp. 61–66.
CASECASE-2017-LeeMKR #approximate
On the accuracy of analytic approximations for the mean cycle time in semiconductor manufacturing equipment with PM events (ML, JRM, AAK, KR), pp. 737–738.
CASECASE-2017-NagavalliCS #behaviour #multi #scheduling
On time-optimal behavior scheduling of robotic swarms for achieving multiple goals (SN, NC, KPS), pp. 1546–1553.
CASECASE-2017-ZhangZ #game studies
On eventual periodicity of networked evolutionary games (KZ, LZ0), pp. 177–180.
FASEFASE-2017-AraujoNN #debugging #effectiveness #predict
On the Effectiveness of Bug Predictors with Procedural Systems: A Quantitative Study (CWA, IN, DJN), pp. 78–95.
CADECADE-2017-HorbachVW #integer #linear
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic (MH, MV, CW), pp. 77–94.
CAVCAV-2017-Ben-AmramG #multi #ranking
On Multiphase-Linear Ranking Functions (AMBA, SG), pp. 601–620.
CAVCAV-2017-Tentrup
On Expansion and Resolution in CEGAR Based QBF Solving (LT), pp. 475–494.
CSLCSL-2017-Boker #automaton
On the (In)Succinctness of Muller Automata (UB), p. 16.
CSLCSL-2017-Oliveira
On Supergraphs Satisfying CMSO Properties (MdOO), p. 15.
CSLCSL-2017-VerbitskyZ #complexity #first-order #morphism
On the First-Order Complexity of Induced Subgraph Isomorphism (OV, MZ), p. 16.
CBSECBSE-2016-CrnkovicMMS #architecture #component #cyber-physical #using
On the Use of Component-Based Principles and Practices for Architecting Cyber-Physical Systems (IC, IM, HM, MS), pp. 23–32.
WICSAWICSA-2016-GallidabinoPIMS #architecture #design
On the Architecture of Liquid Software: Technology Alternatives and Design Space (AG, CP, VI, TM, KS, JPV, AT), pp. 122–127.
WICSAWICSA-2016-MubeenN #abstraction #analysis #component #distributed #embedded
On Timing Analysis of Component-Based Vehicular Distributed Embedded Systems at Various Abstraction Levels (SM, TN), pp. 277–278.
WICSAWICSA-2016-TsigkanosK #formal method #identification #specification
On Formalizing and Identifying Patterns in Cloud Workload Specifications (CT, TK), pp. 262–267.
EDMEDM-2016-JiangG #approach #contest #graph #mining
On Competition for Undergraduate Co-op Placements: A Graph Mining Approach (YHJ, LG), pp. 394–399.
EDMEDM-2016-KidzinskiSBD #modelling
On generalizability of MOOC models (LK, KS, MSB, PD), pp. 406–411.
ICPCICPC-2016-GeffenM
On method ordering (YG, SM), pp. 1–10.
ICPCICPC-2016-VasquezHP #android #automation #detection
On automatically detecting similar Android apps (MLV, AH, DP), pp. 1–10.
ICSMEICSME-2016-Borges #git
On the Popularity of GitHub Software (HB), p. 618.
ICSMEICSME-2016-ChaparroFM
On the Vocabulary Agreement in Software Issue Descriptions (OC, JMF, AM), pp. 448–452.
ICSMEICSME-2016-SawantRB #api #java
On the Reaction to Deprecation of 25, 357 Clients of 4+1 Popular Java APIs (AAS, RR, AB), pp. 400–410.
MSRMSR-2016-MoslehiAR #documentation #mining #speech
On mining crowd-based speech documentation (PM, BA, JR), pp. 259–268.
SANERSANER-2016-0001AKP #consistency #empirical #fault
On the Relationship of Inconsistent Software Clones and Faults: An Empirical Study (SW0, AA, KK, AP), pp. 79–89.
SANERSANER-2016-AltingerDSVW #modelling
On Error-Class Distribution in Automotive Model-Based Software (HA, YD, SS, JJV, FW), pp. 688–692.
SANERSANER-2016-MloukiKA #android #detection #ecosystem
On the Detection of Licenses Violations in the Android Ecosystem (OM, FK, GA), pp. 382–392.
CIAACIAA-2016-IbarraM #bound #linear
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (OHI, IM), pp. 138–149.
CIAACIAA-2016-Lerner #automaton
On Synchronizing Automata and Uniform Distribution (EL), pp. 202–212.
DLTDLT-2016-IbarraM #product line
On Families of Full Trios Containing Counter Machine Languages (OHI, IM), pp. 216–228.
DLTDLT-2016-KweeO #order
On Ordered RRWW-Automata (KK, FO), pp. 268–279.
DLTDLT-2016-ManeaNS #equation #problem #strict #word
On the Solvability Problem for Restricted Classes of Word Equations (FM, DN, MLS), pp. 306–318.
DLTDLT-2016-Paul #ambiguity #automaton #finite #polynomial
On Finite and Polynomial Ambiguity of Weighted Tree Automata (EP), pp. 368–379.
FSCDFSCD-2016-Vries
On Undefined and Meaningless in Lambda Definability (FJdV), p. 15.
IFM-2016-CassarF #framework #implementation #programming
On Implementing a Monitor-Oriented Programming Framework for Actor Systems (IC, AF), pp. 176–192.
IFM-2016-ChenAGSM #behaviour #classification #robust #verification
On Robust Malware Classifiers by Verifying Unwanted Behaviours (WC, DA0, ADG, CAS, IM), pp. 326–341.
IFM-2016-DamianiL #product line #type checking
On Type Checking Delta-Oriented Product Lines (FD, ML), pp. 47–62.
CIKMCIKM-2016-CheemaKALWCR #analysis #health #monitoring #using
On Structural Health Monitoring Using Tensor Analysis and Support Vector Machine with Artificial Negative Data (PC, NLDK, MMA, WL0, YW0, FC0, PR), pp. 1813–1822.
CIKMCIKM-2016-FanWL #analysis #metric #mobile #network #optimisation
On Backup Battery Data in Base Stations of Mobile Networks: Measurement, Analysis, and Optimization (XF, FW0, JL), pp. 1513–1522.
CIKMCIKM-2016-LiKZH #classification #network
On Transductive Classification in Heterogeneous Information Networks (XL, BK, YZ, ZH0), pp. 811–820.
CIKMCIKM-2016-LiSCS #adaptation #effectiveness #query #rank
On the Effectiveness of Query Weighting for Adapting Rank Learners to New Unlabelled Collections (PL, MS, MJC, FS), pp. 1413–1422.
ECIRECIR-2016-HasibiBB
On the Reproducibility of the TAGME Entity Linking System (FH, KB, SEB), pp. 436–449.
ECIRECIR-2016-MagdyEH #evaluation #generative #timeline #twitter
On the Evaluation of Tweet Timeline Generation Task (WM, TE, MH), pp. 648–653.
ECIRECIR-2016-NajiA #information retrieval
On Cross-Script Information Retrieval (NN, JA), pp. 796–802.
ICMLICML-2016-ArjevaniS #algorithm #complexity #first-order #optimisation
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms (YA, OS), pp. 908–916.
ICMLICML-2016-HazanLS #optimisation #probability #problem
On Graduated Optimization for Stochastic Non-Convex Problems (EH, KYL, SSS), pp. 1833–1841.
ICMLICML-2016-KhandelwalLNS #analysis #monte carlo
On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search (PK, EL, SN, PS), pp. 1319–1328.
ICMLICML-2016-PandeyD #metric #random #representation
On collapsed representation of hierarchical Completely Random Measures (GP0, AD), pp. 1605–1613.
ICMLICML-2016-Papakonstantinou #learning
On the Power and Limits of Distance-Based Learning (PAP, JX0, GY), pp. 2263–2271.
ICMLICML-2016-SafranS #network #quality
On the Quality of the Initial Basin in Overspecified Neural Networks (IS, OS), pp. 774–782.
ICMLICML-2016-WangGL #statistics
On the Statistical Limits of Convex Relaxations (ZW, QG, HL0), pp. 1368–1377.
ICMLICML-2016-ZhangGR #consistency #feature model
On the Consistency of Feature Selection With Lasso for Non-linear Targets (YZ, WG, SR), pp. 183–191.
ICPRICPR-2016-GuY #approximate #parametricity
On the magnitude of parameters of RBMs being universal approximators (LG, LY), pp. 2470–2474.
ICPRICPR-2016-KabkabHC #network #performance
On the size of Convolutional Neural Networks and generalization performance (MK, EMH, RC), pp. 3572–3577.
ICPRICPR-2016-KouwL #estimation #parametricity
On regularization parameter estimation under covariate shift (WMK, ML), pp. 426–431.
ICPRICPR-2016-MarcaciniCD #distance
On combining Websensors and DTW distance for kNN Time Series Forecasting (RMM, JCC, JD), pp. 2521–2525.
ICPRICPR-2016-MurakamiKT #strict
On restricting modalities in likelihood-ratio based biometric score fusion (TM, YK, KT), pp. 3036–3042.
ICPRICPR-2016-SidibeRM #detection #multi #using
On spatio-temporal saliency detection in videos using multilinear PCA (DS, MR, FM), pp. 1876–1880.
ICPRICPR-2016-YuenMT #algorithm #dataset #evaluation
On looking at faces in an automobile: Issues, algorithms and evaluation on naturalistic driving dataset (KY, SM, MMT), pp. 2777–2782.
MoDELSMoDELS-2016-Kosiuczenko #contract #protocol #state machine #synthesis
On the synthesis of protocol state machines from contracts (PK), pp. 76–85.
LOPSTRLOPSTR-2016-MesnardPV #logic programming #source code #testing #unification
On the Completeness of Selective Unification in Concolic Testing of Logic Programs (FM, ÉP, GV), pp. 205–221.
PLDIPLDI-2016-0001HM #complexity #parsing #performance
On the complexity and performance of parsing with derivatives (MDA0, CH, MM), pp. 224–236.
SASSAS-2016-MauricaMP #float #linear #problem #ranking
On the Linear Ranking Problem for Simple Floating-Point Loops (FM, FM, ÉP), pp. 300–316.
ASEASE-2016-MeinickeWKTS #complexity #configuration management #interactive
On essential configuration complexity: measuring interactions in highly-configurable systems (JM, CPW, CK, TT, GS), pp. 483–494.
FSEFSE-2016-Kurtz #mutation testing #testing
On the utility of dominator mutants for mutation testing (BK), pp. 1088–1090.
FSEFSE-2016-MaozR #specification
On well-separation of GR(1) specifications (SM, JOR), pp. 362–372.
ICSE-2016-GopinathAAJG #reduction
On the limits of mutation reduction strategies (RG, MAA, IA0, CJ, AG), pp. 511–522.
ICSE-2016-RizziED #case study #tool support
On the techniques we create, the tools we build, and their misalignments: a study of KLEE (EFR, SGE, MBD), pp. 132–143.
CASECASE-2016-BochkarevS
On minimizing turns in robot coverage path planning (SB, SLS0), pp. 1237–1242.
CASECASE-2016-ShinKYJ
On avoiding Moving Objects for indoor autonomous quadrotors (DS, JK, BY, DHJ), pp. 503–508.
CASECASE-2016-SundstromWRL #energy #robust
On the conflict between energy, stability and robustness in production schedules (NS, OW, SR, BL), pp. 1263–1269.
CCCC-2016-RajbhandariKKPR #recursion #traversal
On fusing recursive traversals of K-d trees (SR, JK, SK, LNP, FR, RJH, PS), pp. 152–162.
CCCC-2016-ScholzJSW #datalog #performance #program analysis #scalability
On fast large-scale program analysis in Datalog (BS, HJ, PS, TW), pp. 196–206.
ESOPESOP-2016-DOsualdoO #communication #π-calculus
On Hierarchical Communication Topologies in the π-calculus (ED, CHLO), pp. 149–175.
ESOPESOP-2016-KouzapasPY #higher-order #process
On the Relative Expressiveness of Higher-Order Session Processes (DK, JAP, NY), pp. 446–475.
CSLCSL-2016-GanardiGL #bisimulation #complexity #finite #parallel
On the Parallel Complexity of Bisimulation on Finite Systems (MG, SG, ML), p. 17.
IJCARIJCAR-2016-Sofronie-Stokkermans
On Interpolation and Symbol Elimination in Theory Extensions (VSS), pp. 273–289.
ECSAECSA-2015-MucciniTR #architecture #social
On the Social Dimensions of Architectural Decisions (HM, DAT, VSR), pp. 137–145.
QoSAQoSA-2015-KjaergaardK #architecture #mobile
On Architectural Qualities and Tactics for Mobile Sensing (MBK, MK), pp. 63–72.
HTHT-2015-HaKK #recommendation
On Recommending Newly Published Academic Papers (JH, SHK, SWK), pp. 329–330.
HTHT-2015-LeeHKGH #recommendation
On Recommending Job Openings (YCL, JH, SWK, SG, JYH), pp. 331–332.
PODSPODS-2015-RahulT #2d
On Top-k Range Reporting in 2D Space (SR, YT), pp. 265–275.
SIGMODSIGMOD-2015-LoesingPEK #database #design #distributed #scalability
On the Design and Scalability of Distributed Shared-Data Databases (SL, MP, TE, DK), pp. 663–676.
SIGMODSIGMOD-2015-TerleckiXSKW
On Improving User Response Times in Tableau (PT, FX, MS, VK, RMGW), pp. 1695–1706.
TPDLTPDL-2015-DebruyneBGCD #framework #linked data #open data #platform
On a Linked Data Platform for Irish Historical Vital Records (CD, ODB, RG, SC, SD), pp. 99–110.
TPDLTPDL-2015-FigueiraPAG #case study
On the Impact of Academic Factors on Scholar Popularity: A Cross-Area Study (PF, GP, JMA, MAG), pp. 139–152.
VLDBVLDB-2015-KhanC #graph #modelling #nondeterminism #query
On Uncertain Graphs Modeling and Queries (AK, LC), pp. 2042–2053.
VLDBVLDB-2015-SchuhknechtKD #clustering
On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning (FMS, PK, JD), pp. 934–937.
EDMEDM-2015-BazalduaKDHLW #behaviour #collaboration #convergence #process
On Convergence of Cognitive and Non-cognitive Behavior in Collaborative Activity (DLB, SMK, AAvD, JH, LL, ZW), pp. 496–499.
EDMEDM-2015-KlinglerKSG #modelling #performance
On the Performance Characteristics of Latent-Factor and Knowledge Tracing Models (SK, TK, BS, MHG), pp. 37–44.
ICSMEICSME-2015-NucciPSBOL #debugging #developer #predict
On the role of developer’s scattered changes in bug prediction (DDN, FP, SS, GB, RO, ADL), pp. 241–250.
SANERSANER-2015-Cleland-Huang #question
On whose shoulders? (JCH), p. 1.
SANERSANER-2015-MuskeB #static analysis #tool support
On implementational variations in static analysis tools (TM, PB), pp. 512–515.
SCAMSCAM-2015-UddinGGR #comprehension #eye tracking #using #visualisation
On the comprehension of code clone visualizations: A controlled study using eye tracking (MSU, VG, CG, CKR), pp. 161–170.
CIAACIAA-J-2013-BalkanskiBKW15 #complexity #word
On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
CIAACIAA-J-2013-JirasekJ15 #bound #regular expression
On the boundary of regular languages (JJ, GJ), pp. 42–57.
CIAACIAA-2015-BerglundM #parsing #regular expression #semantics
On the Semantics of Regular Expression Parsing in the Wild (MB, BvdM), pp. 292–304.
CIAACIAA-2015-CaronMM
On the Hierarchy of Block Deterministic Languages (PC, LM, CM), pp. 63–75.
CIAACIAA-2015-GusevS #graph
On the Number of Synchronizing Colorings of Digraphs (VVG, MS), pp. 127–139.
CIAACIAA-2015-HeamJ #automaton #generative #morphism #random
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.
CIAACIAA-2015-MohriR #ambiguity #automaton
On the Disambiguation of Weighted Automata (MM, MDR), pp. 263–278.
DLTDLT-2015-AlmeidaBKK #decidability
On Decidability of Intermediate Levels of Concatenation Hierarchies (JA, JB, OK, MK), pp. 58–70.
DLTDLT-2015-BianchiHK #automaton #liveness #problem
On the Size of Two-Way Reasonable Automata for the Liveness Problem (MPB, JH, IK), pp. 120–131.
DLTDLT-2015-EremondiIM
On the Density of Context-Free and Counter Languages (JE, OHI, IM), pp. 228–239.
DLTDLT-2015-KrebsLL
On Distinguishing NC¹ and NL (AK, KJL, ML), pp. 340–351.
DLTDLT-2015-MasopustT #automaton #complexity #testing
On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.
ICALPICALP-v1-2015-Avigdor-Elgrabli #order #random
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (NAE, SI, BM, YR), pp. 78–90.
ICALPICALP-v1-2015-CzyzowiczGKKSU #convergence #protocol
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (JC, LG, AK, EK, PGS, PU), pp. 393–405.
ICALPICALP-v1-2015-DoronT #approximate #graph #probability #problem
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (DD, ATS), pp. 419–431.
ICALPICALP-v1-2015-DvorakK #csp
On Planar Boolean CSP (ZD, MK), pp. 432–443.
ICALPICALP-v1-2015-Erlebach0K #graph
On Temporal Graph Exploration (TE, MH, FK), pp. 444–455.
ICALPICALP-v1-2015-KurpiszLM #problem
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy (AK, SL, MM), pp. 872–885.
ICALPICALP-v2-2015-BouajjaniEEH #reachability
On Reducing Linearizability to State Reachability (AB, ME, CE, JH), pp. 95–107.
ICALPICALP-v2-2015-FriedrichK #graph #random
On the Diameter of Hyperbolic Random Graphs (TF, AK), pp. 614–625.
ICALPICALP-v2-2015-KuperbergS #automaton #nondeterminism
On Determinisation of Good-for-Games Automata (DK, MS), pp. 299–310.
ICALPICALP-v2-2015-LerouxST #automaton #problem
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.
ICALPICALP-v2-2015-SwernofskyW #complexity
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
LATALATA-2015-BadkobehFL #word
On the Number of Closed Factors in a Word (GB, GF, ZL), pp. 381–390.
LATALATA-2015-BresolinMMSS #complexity #logic
On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (DB, DDM, AM, PS, GS), pp. 511–523.
LATALATA-2015-GodinKP #automaton
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (TG, IK, MP), pp. 328–339.
LATALATA-2015-GonzeJ #probability
On the Synchronizing Probability Function and the Triple Rendezvous Time — New Approaches to Černý’s Conjecture (FG, RMJ), pp. 212–223.
LATALATA-2015-HalavaNP #game studies
On Robot Games of Degree Two (VH, RN, IP), pp. 224–236.
LATALATA-2015-LiH #algebra #automaton #network
On Observability of Automata Networks via Computational Algebra (RL, YH), pp. 249–262.
LATALATA-2015-NayakK #word
On the Language of Primitive Partial Words (ACN, KK), pp. 436–445.
SEFMSEFM-2015-HanazumiM #testing
On the Testability of Properties Patterns (SH, ACVdM), pp. 148–155.
CoGCIG-2015-RunarssonL #approximate #evaluation #game studies #using
On imitating Connect-4 game trajectories using an approximate n-tuple evaluation function (TPR, SML), pp. 208–213.
GCMGCM-2015-Flick #correctness #graph #recursion #source code
On Correctness of Graph Programs Relative to Recursively Nested Conditions (NEF), pp. 97–112.
CHICHI-2015-BowserHMC #experience
On Vintage Values: The Experience of Secondhand Fashion Reacquisition (AEB, OLH, EFM, EFC), pp. 897–906.
CHICHI-2015-SongCOKH #effectiveness
On the Effectiveness of Pattern Lock Strength Meters: Measuring the Strength of Real World Pattern Locks (YS, GC, SO, HK, JHH), pp. 2343–2352.
CSCWCSCW-2015-SlovakTTOF #challenge
On Becoming a Counsellor: Challenges and Opportunities to Support Interpersonal Skills Training (PS, AT, PT, PO, GF), pp. 1336–1347.
HCIDUXU-DD-2015-Liang #industrial #metaprogramming #online
On Chinese Online P2P Lender’s Model Building on the Macro, Micro and Industry Level (QL), pp. 315–327.
HCIHCI-IT-2015-SarsharNR #analysis #human-computer #smarttech #usability
On the Usability of Smartphone Apps in Emergencies — An HCI Analysis of GDACSmobile and SmartRescue Apps (PS, VN, JR), pp. 765–774.
HCIHCI-UC-2015-JeongJ #performance #personalisation
On Time: Efficient and Personalized Hospital Service (SYJ, DYJ), pp. 190–197.
ICEISICEIS-v1-2015-FolinoGP #behaviour #modelling #process
On the Discovery of Explainable and Accurate Behavioral Models for Complex Lowly-structured Business Processes (FF, MG, LP), pp. 206–217.
ICEISICEIS-v2-2015-FrantzSRYE #ecosystem #integration #markov #process #using
On using Markov Decision Processes to Model Integration Solutions for Disparate Resources in Software Ecosystems (RZF, SS, FRF, IY, MTME), pp. 260–267.
ICEISICEIS-v2-2015-MazurKW #data access #modelling #performance #security
On the Modelling of the Influence of Access Control Management to the System Security and Performance (KM, BK, AW), pp. 346–354.
CIKMCIKM-2015-BagdouriO15a #microblog #predict
On Predicting Deletions of Microblog Posts (MB, DWO), pp. 1707–1710.
CIKMCIKM-2015-ChenQW #estimation #set
On Gapped Set Intersection Size Estimation (CC0, JQ, WW0), pp. 1351–1360.
CIKMCIKM-2015-GrauerL #component #interactive
On the Effect of “Stupid” Search Components on User Interaction with Search Engines (LG, AL), pp. 1727–1730.
CIKMCIKM-2015-GuidoGLR #independence
On Query-Update Independence for SPARQL (NG, PG, NL, CR), pp. 1675–1678.
CIKMCIKM-2015-LuMC #cost analysis #modelling #proximity
On the Cost of Extracting Proximity Features for Term-Dependency Models (XL0, AM, JSC), pp. 293–302.
ECIRECIR-2015-GogMP #identification #statistics #using
On Identifying Phrases Using Collection Statistics (SG, AM, MP), pp. 278–283.
ECIRECIR-2015-SchedlHFT #algorithm #music #recommendation
On the Influence of User Characteristics on Music Recommendation Algorithms (MS, DH, KF, MT), pp. 339–345.
ICMLICML-2015-GasseAE #classification #composition #multi #set
On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.
ICMLICML-2015-KordaA #approximate #bound #convergence #exponential
On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence (NK, PLA), pp. 626–634.
ICMLICML-2015-NeyshaburS #symmetry
On Symmetric and Asymmetric LSHs for Inner Product Search (BN, NS), pp. 1926–1934.
ICMLICML-2015-SharmaKD
On Greedy Maximization of Entropy (DS, AK, AD), pp. 1330–1338.
ICMLICML-2015-TagortiS #bound #convergence #fault
On the Rate of Convergence and Error Bounds for LSTD(λ) (MT, BS), pp. 1521–1529.
ICMLICML-2015-WangALB #learning #multi #representation
On Deep Multi-View Representation Learning (WW, RA, KL, JAB), pp. 1083–1092.
ICMLICML-2015-WuGS #combinator #feedback #finite #identification
On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments (YW, AG, CS), pp. 1283–1291.
ICMLICML-2015-ZhaoMP #network
On the Relationship between Sum-Product Networks and Bayesian Networks (HZ, MM, PP), pp. 116–124.
KDDKDD-2015-0002PGM #network
On the Formation of Circles in Co-authorship Networks (TC, SP, PG, AM), pp. 109–118.
KDDKDD-2015-GogaLSTG #network #online #reliability #scalability #social
On the Reliability of Profile Matching Across Large Online Social Networks (OG, PL, RS, RT, KPG), pp. 1799–1808.
KDDKDD-2015-Kifer #category theory
On Estimating the Swapping Rate for Categorical Data (DK), pp. 557–566.
KDDKDD-2015-LiLGSZFH #evolution
On the Discovery of Evolving Truth (YL, QL, JG, LS, BZ, WF, JH), pp. 675–684.
MLDMMLDM-2015-OliveiraVZ #clustering
On Bicluster Aggregation and its Benefits for Enumerative Solutions (SHGdO, RV, FJVZ), pp. 266–280.
SEKESEKE-2015-MagalhaesAM #approach #framework #independence #model transformation #platform #specification
On the Specification of Model Transformations through a Platform Independent Approach (APM, AMSA, RSPM), pp. 558–561.
SIGIRSIGIR-2015-FarSBFH
On Term Selection Techniques for Patent Prior Art Search (MGF, SS, MRB, GF, DH), pp. 803–806.
SIGIRSIGIR-2015-HashemiCDKK #reuse #usability
On the Reusability of Open Test Collections (SHH, CLAC, ADH, JK, JK), pp. 827–830.
SIGIRSIGIR-2015-MegorskayaKS #assessment
On the Relation Between Assessor’s Agreement and Accuracy in Gamified Relevance Assessment (OM, VK, PS), pp. 605–614.
SIGIRSIGIR-2015-PetriM #cost analysis #ranking
On the Cost of Phrase-Based Ranking (MP, AM), pp. 931–934.
ECMFAECMFA-2015-BruneliereGDKHB #lightweight #metamodelling #modelling #tool support
On Lightweight Metamodel Extension to Support Modeling Tools Agility (HB, JG, PD, DEK, RH, RB, JC), pp. 62–74.
MoDELSMoDELS-2015-Fernandez-SaezC #documentation #industrial #maintenance #overview #uml #using
On the use of UML documentation in software maintenance: Results from a survey in industry (AMFS, DC, MG, MRVC), pp. 292–301.
PLATEAUPLATEAU-2015-HanenbergS #community
On the need to define community agreements for controlled experiments with human subjects: a discussion paper (SH, AS), pp. 61–67.
LOPSTRLOPSTR-2015-Seki #logic programming #source code
On Dual Programs in Co-Logic Programming (HS), pp. 21–35.
PADLPADL-2015-CruzR #compilation #linear #logic programming #source code
On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities (FC, RR), pp. 34–49.
PADLPADL-2015-Tarau #combinator #generative #logic programming #normalisation #type inference
On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.
POPLPOPL-2015-ElangoRPRS #complexity #data access #source code
On Characterizing the Data Access Complexity of Programs (VE, FR, LNP, JR, PS), pp. 567–580.
PPDPPPDP-2015-BartakDZ #logic programming #modelling #problem
On modeling planning problems in tabled logic programming (RB, AD, NFZ), pp. 31–42.
PPDPPPDP-2015-Tarau #combinator #representation
On a uniform representation of combinators, arithmetic, λ terms and types (PT), pp. 244–255.
ESEC-FSEESEC-FSE-2015-HammoudiBBR #debugging #using #web
On the use of delta debugging to reduce recordings and facilitate debugging of web applications (MH, BB, GB, GR), pp. 333–344.
ICSEICSE-v2-2015-BarnBR #re-engineering
On the Role of Value Sensitive Concerns in Software Engineering Practice (BSB, RB, FR), pp. 497–500.
ICSEICSE-v2-2015-Cavalcante #architecture #development
On the Architecture-Driven Development of Software-Intensive Systems-of-Systems (EC), pp. 899–902.
ICSEICSE-v2-2015-SongENCFC #adaptation #architecture
On Architectural Diversity of Dynamic Adaptive Systems (HS, AE, VN, FC, FF, SC), pp. 595–598.
SACSAC-2015-BerardiCEM #microblog #realtime
On the impact of entity linking in microblog real-time filtering (GB, DC, AE, DM), pp. 1066–1071.
SACSAC-2015-BurkhardtK #classification #multi
On the spectrum between binary relevance and classifier chains in multi-label classification (SB, SK), pp. 885–892.
SACSAC-2015-FonooniH #behaviour #visual notation
On the similarities between control based and behavior based visual servoing (BF, TH), pp. 320–326.
SACSAC-2015-JoCKBO #algorithm #approach #collaboration #cpu #data-driven
On running data-intensive algorithms with intelligent SSD and host CPU: a collaborative approach (YYJ, SC, SWK, DHB, HO), pp. 2060–2065.
SACSAC-2015-OkkaliogluKP
On the discovery of fake binary ratings (MO, MK, HP), pp. 901–907.
SACSAC-2015-SioutisSC #composition #graph #reasoning
On the use and effect of graph decomposition in qualitative spatial and temporal reasoning (MS, YS, JFC), pp. 1874–1879.
SLESLE-2015-MaroSATG #domain-specific language #editing #experience #industrial #uml #visual notation
On integrating graphical and textual editors for a UML profile based domain specific language: an industrial experience (SM, JPS, AA, MT, LG), pp. 1–12.
CASECASE-2015-BergagardF #automation #using
On restart of automated manufacturing systems using restart states (PB, MF), pp. 166–167.
CASECASE-2015-MoalDC #case study #monitoring #overview #process
On the feasibility of a monitoring system for the friction stir welding process: Literature review and experimental study (GLM, FD, DC), pp. 1576–1583.
CGOCGO-2015-ZhengLHWJ #approach #debugging #manycore #performance
On performance debugging of unnecessary lock contentions on multicore processors: a replay-based approach (LZ, XL, BH, SW, HJ), pp. 56–67.
DACDAC-2015-TashjianD #identification #using
On using control signals for word-level identification in a gate-level netlist (ET, AD), p. 6.
DATEDATE-2015-AntoniadisKEBS #architecture #memory management #optimisation #statistics
On the statistical memory architecture exploration and optimization (CA, GK, NEE, APB, GIS), pp. 543–548.
DATEDATE-2015-RiefertCSRB #automation #generative #source code
On the automatic generation of SBST test programs for in-field test (AR, RC, MS, MSR, BB), pp. 1186–1191.
DATEDATE-2015-YeYZX
On the premises and prospects of timing speculation (RY, FY, JZ, QX), pp. 605–608.
PDPPDP-2015-RossiXMR #clustering #energy
On the Impact of Energy-Efficient Strategies in HPC Clusters (FDR, MGX, YJM, CAFDR), pp. 17–21.
PDPPDP-2015-ThomanGF #concurrent #implementation #library #quality #thread
On the Quality of Implementation of the C++11 Thread Support Library (PT, PG, TF), pp. 94–98.
PPoPPPPoPP-2015-AshariTBRCKS #kernel #machine learning #optimisation
On optimizing machine learning workloads via kernel fusion (AA, ST, MB, BR, KC, JK, PS), pp. 173–182.
FoSSaCSFoSSaCS-2015-BacciBLM #distance #markov
On the Total Variation Distance of Semi-Markov Chains (GB, GB, KGL, RM), pp. 185–199.
FoSSaCSFoSSaCS-2015-BagnolDS #dependence #logic
On the Dependencies of Logical Rules (MB, AD, AS), pp. 436–450.
FoSSaCSFoSSaCS-2015-HabermehlK #quantifier
On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
FoSSaCSFoSSaCS-2015-SchubertUZ #first-order #logic
On the Mints Hierarchy in First-Order Intuitionistic Logic (AS, PU, KZ), pp. 451–465.
STOCSTOC-2015-BansalGG #graph #independence #set
On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
STOCSTOC-2015-ChenDO #complexity #game studies #nash
On the Complexity of Nash Equilibria in Anonymous Games (XC, DD, AO), pp. 381–390.
STOCSTOC-2015-FeldmanPV #complexity #problem #random #satisfiability
On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
TACASTACAS-2015-ChakrabortyFMSV #generative #parallel #satisfiability #scalability
On Parallel Scalable Uniform SAT Witness Generation (SC, DJF, KSM, SAS, MYV), pp. 304–319.
CAVCAV-2015-CookKP #automation #infinity #verification
On Automation of CTL* Verification for Infinite-State Systems (BC, HK, NP), pp. 13–29.
CSLCSL-2015-AminiE #linear #logic
On Classical PCF, Linear Logic and the MIX Rule (SA, TE), pp. 582–596.
CSLCSL-2015-DuparcFH #ambiguity
On Unambiguous Regular Tree Languages of Index (0, 2) (JD, KF, SH), pp. 534–548.
CSLCSL-2015-KupfermanV #finite #probability
On Relative and Probabilistic Finite Counterability (OK, GV), pp. 175–192.
ICLPICLP-2015-KieslST #analysis #source code
On Structural Analysis of Non-Ground Answer-Set Programs (BK, PS, HT), pp. 221–234.
ICLPICLP-2015-Tarau #generative
On Type-directed Generation of λ Terms (PT), pp. 60–72.
ICSTICST-2015-AlegrothBB #case study #empirical #industrial
On the Industrial Applicability of TextTest: An Empirical Case Study (EA, GB, EB), pp. 1–10.
LICSLICS-2015-AccattoliC
On the Relative Usefulness of Fireballs (BA, CSC), pp. 141–155.
LICSLICS-2015-BozzelliP #complexity #equilibrium #logic
On the Complexity of Temporal Equilibrium Logic (LB, DP), pp. 645–656.
LICSLICS-2015-LechnerOW #complexity #linear
On the Complexity of Linear Arithmetic with Divisibility (AL, JO, JW), pp. 667–676.
ICSTSAT-2015-BovaCMS #compilation
On Compiling CNFs into Structured Deterministic DNNFs (SB, FC, SM, FS), pp. 199–214.
DocEngDocEng-2014-DadachevBB #automation #segmentation
On automatic text segmentation (BD, AB, HB), pp. 73–80.
HTHT-2014-0001IAS #predict
On the predictability of talk attendance at academic conferences (CS, JI, MA, GS), pp. 279–284.
HTHT-2014-Santos-NetoPAR #data flow #optimisation
On the choice of data sources to improve content discoverability via textual feature optimization (ESN, TP, JMA, MR), pp. 273–278.
JCDLJCDL-2014-PopNP #deployment
On Cloud deployment of digital preservation environments (DP, MN, DP), pp. 443–444.
PODSPODS-2014-FanGL #big data #independence #query
On scale independence for querying big data (WF, FG, LL), pp. 51–62.
SIGMODSIGMOD-2014-ZhangDI #complexity #optimisation #query
On complexity and optimization of expensive queries in complex event processing (HZ, YD, NI), pp. 217–228.
VLDBVLDB-2014-FunkeNS
On k-Path Covers and their Applications (SF, AN, SS), pp. 893–902.
VLDBVLDB-2014-LinK #query
On Arbitrage-free Pricing for General Data Queries (BRL, DK), pp. 757–768.
VLDBVLDB-2014-Song0C #set
On Concise Set of Relative Candidate Keys (SS, LC, HC), pp. 1179–1190.
SANERCSMR-WCRE-2014-ClaesMG #maintenance
On the maintainability of CRAN packages (MC, TM, PG), pp. 308–312.
ICPCICPC-2014-JbaraF #comprehension
On the effect of code regularity on comprehension (AJ, DGF), pp. 189–200.
ICPCICPC-2014-ShobeKZK #commit #open source
On mapping releases to commits in open source systems (JFS, MYK, MBZ, HHK), pp. 68–71.
ICSMEICSME-2014-BiazziniMB #commit #distributed #version control
On Analyzing the Topology of Commit Histories in Decentralized Version Control Systems (MB, MM, BB), pp. 261–270.
ICSMEICSME-2014-ChaparroBMP #metric #quality #refactoring
On the Impact of Refactoring Operations on Code Quality Metrics (OC, GB, AM, MDP), pp. 456–460.
ICSMEICSME-2014-MorenoTMS #debugging #locality #stack #using
On the Use of Stack Traces to Improve Text Retrieval-Based Bug Localization (LM, JJT, AM, WS), pp. 151–160.
ICSMEICSME-2014-SahaLKP #c #debugging #effectiveness #information retrieval #locality #source code
On the Effectiveness of Information Retrieval Based Bug Localization for C Programs (RKS, JL, SK, DEP), pp. 161–170.
SCAMSCAM-2014-Cortes-CoyVAP #automation #commit #generative #source code #summary
On Automatically Generating Commit Messages via Summarization of Source Code Changes (LFCC, MLV, JA, DP), pp. 275–284.
SCAMSCAM-2014-JiangSGC #maintenance #slicing
On the Accuracy of Forward Dynamic Slicing and Its Effects on Software Maintenance (SJ, RAS, MG, HC), pp. 145–154.
SCAMSCAM-2014-RahmanR14a #exception #recommendation #using
On the Use of Context in Recommending Exception Handling Code Examples (MMR, CKR), pp. 285–294.
DLTDLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #problem #quantum
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
DLTDLT-J-2013-DayRS14 #problem
On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 1033–1048.
DLTDLT-J-2013-GocRRS14 #automation #word
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.
AFLAFL-2014-CarninoL #ambiguity #automaton
On Determinism and Unambiguity of Weighted Two-way Automata (VC, SL), pp. 188–200.
AFLAFL-2014-Klima #algebra #automaton
On Varieties of Automata Enriched with an Algebraic Structure (OK), pp. 49–54.
CIAACIAA-2014-BianchiMP #automaton #power of #quantum
On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.
CIAACIAA-2014-BieglerM #automaton #finite #word
On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.
CIAACIAA-2014-CevorovaJK #regular expression
On the Square of Regular Languages (KC, GJ, IK), pp. 136–147.
CIAACIAA-2014-Ibarra #ambiguity #problem #transducer
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (OHI), pp. 211–225.
DLTDLT-2014-BerdinskyK #automation #graph #transitive
On Automatic Transitive Graphs (DB, BK), pp. 1–12.
DLTDLT-2014-Berlinkov #algorithm #automaton #problem
On Two Algorithmic Problems about Synchronizing Automata — (MVB), pp. 61–67.
DLTDLT-2014-FeliceN #algorithm #automaton #complexity
On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
DLTDLT-2014-KarhumakiP #word
On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.
ICALPICALP-v1-2014-AmirCLL
On Hardness of Jumbled Indexing (AA, TMC, ML, NL), pp. 114–125.
ICALPICALP-v1-2014-BavarianGI #communication
On the Role of Shared Randomness in Simultaneous Communication (MB, DG, TI), pp. 150–162.
ICALPICALP-v1-2014-Biedl #graph
On Area-Optimal Planar Graph Drawings (TCB), pp. 198–210.
ICALPICALP-v1-2014-BlaisHST #approximate
On DNF Approximators for Monotone Boolean Functions (EB, JH, RAS, LYT), pp. 235–246.
ICALPICALP-v1-2014-IvanyosKQSS #complexity #constraints #fault #problem
On the Complexity of Trial and Error for Constraint Satisfaction Problems (GI, RK, YQ, MS, AS), pp. 663–675.
ICALPICALP-v1-2014-OstrovskyPV #proving
On Input Indistinguishable Proof Systems (RO, GP, IV), pp. 895–906.
ICALPICALP-v1-2014-Volkovich #bound #learning
On Learning, Lower Bounds and (un)Keeping Promises (IV), pp. 1027–1038.
ICALPICALP-v2-2014-BojanczykGMS #decidability #infinity
On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.
ICALPICALP-v2-2014-BundalaO #complexity
On the Complexity of Temporal-Logic Path Checking (DB, JO), pp. 86–97.
ICALPICALP-v2-2014-OuaknineW #linear #problem #sequence
On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.
LATALATA-2014-BoyarKLL #problem
On the List Update Problem with Advice (JB, SK, KSL, ALO), pp. 210–221.
LATALATA-2014-GalleT #incremental
On Context-Diverse Repeats and Their Incremental Computation (MG, MT), pp. 384–395.
LATALATA-2014-GwynneK #constraints #satisfiability
On SAT Representations of XOR Constraints (MG, OK), pp. 409–420.
LATALATA-2014-IbarraR #problem
On the Parikh Membership Problem for FAs, PDAs, and CMs (OHI, BR), pp. 14–31.
LATALATA-2014-Kalocinski
On Computability and Learnability of the Pumping Lemma Function (DK), pp. 433–440.
LATALATA-2014-MasseTT
On the Arithmetics of Discrete Figures (ABM, AMT, HT), pp. 198–209.
LATALATA-2014-ZhengGQ #automaton #complexity #finite
On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.
FLOPSFLOPS-2014-HanadaI #multi #persistent #programming
On Cross-Stage Persistence in Multi-Stage Programming (YH, AI), pp. 103–118.
ICFPICFP-2014-Ramsey #design #education
On teaching *how to design programs*: observations from a newcomer (NR), pp. 153–166.
ICGTICGT-2014-HaymanH #category theory
On Pushouts of Partial Maps (JH, TH), pp. 177–191.
CHICHI-2014-BalataCM #2d #using
On the selection of 2D objects using external labeling (JB, LC, ZM), pp. 2255–2258.
HCIDUXU-DP-2014-PosadaHB #motivation #user interface
On Feelings of Comfort, Motivation and Joy that GUI and TUI Evoke (JEGP, ECSH, MCCB), pp. 273–284.
HCIDUXU-TMT-2014-FaroughiM #design #idea
On the Idea of Design: Analyzing the Ideal Form of Cars (AF, SM), pp. 64–73.
HCISCSM-2014-HardjonoDC #design #framework #self
On the Design of Trustworthy Compute Frameworks for Self-organizing Digital Institutions (TH, PD, JHC), pp. 342–353.
CAiSECAiSE-2014-PadilhaPFAGS #detection #effectiveness #empirical #metric #smell
On the Effectiveness of Concern Metrics to Detect Code Smells: An Empirical Study (JP, JAP, EF, JMA, AG, CS), pp. 656–671.
CAiSECAiSE-2014-RiveniTD #social
On the Elasticity of Social Compute Units (MR, HLT, SD), pp. 364–378.
ICEISICEIS-v1-2014-KleinSRF #formal method #integration #using
On the Formalisation of an Application Integration Language Using Z Notation (MJK, SS, FRF, RZF), pp. 314–319.
CIKMCIKM-2014-CanutoSGRRGRM #classification #effectiveness #performance
On Efficient Meta-Level Features for Effective Text Classification (SDC, TS, MAG, LCdR, GSR, LG, TCR, WSM), pp. 1709–1718.
CIKMCIKM-2014-DeveaudAMO #learning #rank
On the Importance of Venue-Dependent Features for Learning to Rank Contextual Suggestions (RD, MDA, CM, IO), pp. 1827–1830.
CIKMCIKM-2014-HannulaKL #independence
On Independence Atoms and Keys (MH, JK, SL), pp. 1229–1238.
CIKMCIKM-2014-KalyanakrishnanSK #online #scalability
On Building Decision Trees from Large-scale Data in Applications of On-line Advertising (SK, DS, RK), pp. 669–678.
ECIRECIR-2014-CatenaMO #performance
On Inverted Index Compression for Search Engine Efficiency (MC, CM, IO), pp. 359–371.
ECIRECIR-2014-FrommholzA #clustering
On Clustering and Polyrepresentation (IF, MKA), pp. 618–623.
ECIRECIR-2014-LiakosPS #locality #network #social
On the Effect of Locality in Compressing Social Networks (PL, KP, MS), pp. 650–655.
ICMLICML-c1-2014-LiWLZT #dependence #modelling #topic
On Modelling Non-linear Topical Dependencies (ZL, SW, JL, PZ, JT), pp. 458–466.
ICMLICML-c1-2014-OrabonaHSJ #random
On Measure Concentration of Random Maximum A-Posteriori Perturbations (FO, TH, ADS, TSJ), pp. 432–440.
ICMLICML-c2-2014-JawanpuriaVN #feature model #kernel #learning #multi
On p-norm Path Following in Multiple Kernel Learning for Non-linear Feature Selection (PJ, MV, JSN), pp. 118–126.
ICMLICML-c2-2014-KricheneDB #convergence #learning
On the convergence of no-regret learning in selfish routing (WK, BD, AMB), pp. 163–171.
ICMLICML-c2-2014-SongGJMHD #learning #locality
On learning to localize objects with minimal supervision (HOS, RBG, SJ, JM, ZH, TD), pp. 1611–1619.
ICMLICML-c2-2014-TorkamaniL #robust
On Robustness and Regularization of Structural Support Vector Machines (MT, DL), pp. 577–585.
ICPRICPR-2014-CruzSC
On Meta-learning for Dynamic Ensemble Selection (RMOC, RS, GDCC), pp. 1230–1235.
ICPRICPR-2014-DeCannRC #clustering
On Clustering Human Gait Patterns (BD, AR, MC), pp. 1794–1799.
ICPRICPR-2014-DhamechaSSV #effectiveness
On Effectiveness of Histogram of Oriented Gradient Features for Visible to Near Infrared Face Matching (TID, PS, RS, MV), pp. 1788–1793.
ICPRICPR-2014-GuptaBVS #using
On Iris Spoofing Using Print Attack (PG, SB, MV, RS), pp. 1681–1686.
ICPRICPR-2014-Mishra0M #clustering #database #validation
On Validation of Clustering Techniques for Bibliographic Databases (SM, SS, SM), pp. 3150–3155.
ICPRICPR-2014-RosaCJPFT #clustering #network #using
On the Training of Artificial Neural Networks with Radial Basis Function Using Optimum-Path Forest Clustering (GHR, KAPC, LAPJ, JPP, AXF, JMRST), pp. 1472–1477.
ICPRICPR-2014-SalmonW #recognition #scalability
On the Scalability of Graphic Symbol Recognition (JPS, LW), pp. 533–537.
ICPRICPR-2014-SatzodaT #estimation #evaluation #metric #performance
On Performance Evaluation Metrics for Lane Estimation (RKS, MMT), pp. 2625–2630.
ICPRICPR-2014-WilliamsCD #automation #human-computer #recognition
On Human Perception and Automatic Target Recognition: Strategies for Human-Computer Cooperation (DPW, MC, SD), pp. 4690–4695.
KDDKDD-2014-00020GMB #community #network
On the permanence of vertices in network communities (TC, SS, NG, AM, SB), pp. 1396–1405.
KDDKDD-2014-LiLBLY #social
On social event organization (KL, WL, SB, LVSL, CY), pp. 1206–1215.
KRKR-2014-BelleL14a #multi
On the Progression of Knowledge in Multiagent Systems (VB, GL).
KRKR-2014-Coste-MarquisKMM
On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses (SCM, SK, JGM, PM).
KRKR-2014-DuckhamLLL #constraints
On Redundant Topological Constraints (MD, SL, WL, ZL).
KRKR-2014-EveraereKM
On Egalitarian Belief Merging (PE, SK, PM).
KRKR-2014-Razgon #bound
On OBDDs for CNFs of Bounded Treewidth (IR).
RecSysRecSys-2014-AdamopoulosT14a #bias #collaboration #probability #recommendation
On over-specialization and concentration bias of recommendations: probabilistic neighborhood selection in collaborative filtering systems (PA, AT), pp. 153–160.
SEKESEKE-2014-RodriguesPTZOS #automation #component #design #requirements
On the Requirements and Design Decisions of an In-House Component-Based SPL Automated Environment (EMR, LTP, LT, AFZ, FMdO, RSS), pp. 402–407.
SIGIRSIGIR-2014-AlipovTT
On peculiarities of positional effects in sponsored search (VA, VAT, IT), pp. 1015–1018.
SIGIRSIGIR-2014-ChakrabortyRSB #correlation #effectiveness
On correlation of absence time and search effectiveness (SC, FR, MS, PB), pp. 1163–1166.
SIGIRSIGIR-2014-GolbusA #difference #modelling #retrieval #standard
On the information difference between standard retrieval models (PBG, JAA), pp. 1135–1138.
SIGIRSIGIR-2014-Ma #recommendation #social
On measuring social friend interest similarities in recommender systems (HM), pp. 465–474.
SIGIRSIGIR-2014-MitraSRH #interactive #query
On user interactions with query auto-completion (BM, MS, FR, KH), pp. 1055–1058.
SIGIRSIGIR-2014-NguyenL #microblog #network #predict
On predicting religion labels in microblogging networks (MTN, EPL), pp. 1211–1214.
SIGIRSIGIR-2014-VoorheesLE #as a service #evaluation
On run diversity in Evaluation as a Service (EMV, JL, ME), pp. 959–962.
AMTAMT-2014-GogollaHH #dynamic analysis #modelling #ocl #uml
On Static and Dynamic Analysis of UML and OCL Transformation Models (MG, LH, FH), pp. 24–33.
ICMTICMT-2014-WieberAS #automation #graph grammar #model transformation #testing
On the Usage of TGGs for Automated Model Transformation Testing (MW, AA, AS), pp. 1–16.
MODELSMoDELS-2014-OgunyomiRK #incremental #model-to-text #using
On the Use of Signatures for Source Incremental Model-to-text Transformation (BO, LMR, DSK), pp. 84–98.
MODELSMoDELS-2014-Storrle #comprehension #diagrams #layout #matter #quality #uml
On the Impact of Layout Quality to Understanding UML Diagrams: Size Matters (HS), pp. 518–534.
SPLCSPLC-2014-KnappRS #development #modelling #product line #testing #using
On the use of test cases in model-based software product line development (AK, MR, BHS), pp. 247–251.
PPDPPPDP-J-2012-Thielecke14 #parsing #semantics
On the semantics of parsing actions (HT), pp. 52–76.
PEPMPEPM-J-2013-Garcia-PerezN14 #automaton #functional #hybrid
On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines (ÁGP, PN), pp. 176–199.
LOPSTRLOPSTR-2014-Drabent #logic programming #source code
On Completeness of Logic Programs (WD), pp. 261–278.
PADLPADL-2014-AreiasR #correctness #logic programming #performance #source code
On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
PLDIPLDI-2014-ZhangMGNY #abstraction #analysis #datalog #refinement
On abstraction refinement for program analyses in Datalog (XZ, RM, RG, MN, HY), p. 27.
POPLPOPL-2014-LagoSA #functional #higher-order #induction #probability #source code
On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
PPDPPPDP-2014-ChenDY #precise #type system
On the Preciseness of Subtyping in Session Types (TCC, MDC, NY), pp. 135–146.
PPDPPPDP-2014-Haemmerle #constraints #logic programming
On Combining Backward and Forward Chaining in Constraint Logic Programming (RH), pp. 213–224.
PPDPPPDP-2014-Karczmarczuk #concept #declarative #quantum
On the Declarative Structure of Quantum Concepts: States and Observables (JK), pp. 105–110.
SASSAS-2014-IoossAR #equivalence #reduction
On Program Equivalence with Reductions (GI, CA, SVR), pp. 168–183.
FSEFSE-2014-BohmeP #automation #performance #testing
On the efficiency of automated testing (MB, SP), pp. 632–642.
FSEFSE-2014-TuSD #locality
On the localness of software (ZT, ZS, PTD), pp. 269–280.
SACSAC-2014-AlexandreMP #algorithm #multi
On the support of task-parallel algorithmic skeletons for multi-GPU computing (FA, RM, HP), pp. 880–885.
SACSAC-2014-BonifacioM #testing
On the completeness of test suites (ALB, AVM), pp. 1287–1292.
SACSAC-2014-GuimaraesGF #composition #quantifier
On the impact of obliviousness and quantification on model composition effort (EG, AG, KF), pp. 1043–1048.
DACDAC-2014-ChangCCKLL
On Trading Wear-leveling with Heal-leveling (YMC, YHC, JJC, TWK, HPL, HTL), p. 6.
DACDAC-2014-GebalaMMRT #using
On Using Implied Values in EDT-based Test Compression (MG, GM, NM, JR, JT), p. 6.
DACDAC-2014-HuangYT #fault tolerance #scheduling
On the Scheduling of Fault-Tolerant Mixed-Criticality Systems (PH, HY, LT), p. 6.
DACDAC-2014-JungSWPL #3d #perspective
On Enhancing Power Benefits in 3D ICs: Block Folding and Bonding Styles Perspective (MJ, TS, YW, YP, SKL), p. 6.
DACDAC-2014-KimM #3d #design #reliability
On the Design of Reliable 3D-ICs Considering Charged Device Model ESD Events During Die Stacking (DK, SM), p. 6.
DACDAC-2014-WangX #performance #simulation
On the Simulation of NBTI-Induced Performance Degradation Considering Arbitrary Temperature and Voltage Variations (TW, QX), p. 6.
DACDAC-2014-WuWNBP
On Timing Closure: Buffer Insertion for Hold-Violation Removal (PCW, MDFW, IN, SB, VP), p. 6.
DATEDATE-2014-AltmeyerD #analysis #correctness #precise #probability
On the correctness, optimality and precision of Static Probabilistic Timing Analysis (SA, RID), pp. 1–6.
DATEDATE-2014-HaddadTBF #independence #modelling #probability
On the assumption of mutual independence of jitter realizations in P-TRNG stochastic models (PH, YT, FB, VF), pp. 1–6.
DATEDATE-2014-LeeL #3d #gpu #reduction
On GPU bus power reduction with 3D IC technologies (YJL, SKL), pp. 1–6.
PDPPDP-2014-GrandjeanU #2d #clustering #difference #distributed #finite #memory management #parallel
On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers (AG, BU), pp. 9–16.
ESOPESOP-2014-CrubilleL #bisimulation #call-by #probability #λ-calculus
On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (RC, UDL), pp. 209–228.
FoSSaCSFoSSaCS-2014-ErbaturKMMNR #problem #symmetry #unification
On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
FoSSaCSFoSSaCS-2014-EsparzaD #concurrent
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (JE, JD), pp. 258–273.
STOCSTOC-2014-BitanskyCPR
On the existence of extractable one-way functions (NB, RC, OP, AR), pp. 505–514.
STOCSTOC-2014-GoldreichW #algorithm
On derandomizing algorithms that err extremely rarely (OG, AW), pp. 109–118.
TACASTACAS-2014-BoenderC #algorithm #branch #correctness
On the Correctness of a Branch Displacement Algorithm (JB, CSC), pp. 605–619.
ICLPICLP-J-2014-Antic #set #source code
On Cascade Products of Answer Set Programs (CA), pp. 711–723.
ICLPICLP-J-2014-DuckHS #confluence #consistency #termination #type inference
On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.
ICSTICST-2014-DenaroPV #data flow #testing
On the Right Objectives of Data Flow Testing (GD, MP, MV), pp. 71–80.
ICTSSICTSS-2014-El-FakihSY #assessment #automaton #test coverage #testing
On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment (KEF, TS, NY), pp. 198–204.
LICSLICS-CSL-2014-BernardoSV #higher-order #interactive #power of
On the discriminating power of passivation and higher-order interaction (MB, DS, VV), p. 10.
LICSLICS-CSL-2014-Breuvart #modelling
On the characterization of models of H (FB), p. 10.
LICSLICS-CSL-2014-ChenK #distance #markov
On the total variation distance of labelled Markov chains (TC, SK), p. 10.
LICSLICS-CSL-2014-Das
On the pigeonhole and related principles in deep inference and monotone systems (AD), p. 10.
LICSLICS-CSL-2014-EndrullisH #morphism
On periodically iterated morphisms (JE, DH), p. 10.
LICSLICS-CSL-2014-KikotKPZ #ontology #query
On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.
LICSLICS-CSL-2014-KreutzerS
On Hanf-equivalence and the number of embeddings of small induced subgraphs (SK, NS), p. 10.
LICSLICS-CSL-2014-Mamino #power of
On the computing power of +, -, and × (MM), p. 10.
LICSLICS-CSL-2014-Mamouras #hoare #monad #recursion
On the Hoare theory of monadic recursion schemes (KM), p. 10.
LICSLICS-CSL-2014-Perrinel #interactive #semantics
On context semantics and interaction nets (MP), p. 10.
ICSTSAT-2014-IgnatievMM #independence #satisfiability #set
On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
ICSTSAT-2014-Marques-SilvaP
On Computing Preferred MUSes and MCSes (JMS, AP), pp. 58–74.
QoSAQoSA-2013-DurdikR #design pattern #documentation #using
On the appropriate rationale for using design patterns and pattern documentation (ZD, RHR), pp. 107–116.
DocEngDocEng-2013-SilvaSMB #performance #xpath
On the performance of the position() XPath function (LAMdS, LLNdSJ, MM, VB), pp. 229–230.
HTHT-2013-Luczak-RoschT #web
On the topology of the web of data (MLR, RT), pp. 253–257.
HTHT-2013-NasimIRN #behaviour #facebook
On commenting behavior of Facebook users (MN, MUI, AR, NN), pp. 179–183.
ICDARICDAR-2013-MoyssetK #algorithm #detection #evaluation
On the Evaluation of Handwritten Text Line Detection Algorithms (BM, CK), pp. 185–189.
ICDARICDAR-2013-NeumannM #multi #recognition
On Combining Multiple Segmentations in Scene Text Recognition (LN, JM), pp. 523–527.
ICDARICDAR-2013-PantkeMF #evaluation #word
On Evaluation of Segmentation-Free Word Spotting Approaches without Hard Decisions (WP, VM, TF), pp. 1300–1304.
ICDARICDAR-2013-TeradaHFU #detection
On the Possibility of Structure Learning-Based Scene Character Detector (YT, RH, YF, SU), pp. 472–476.
PODSPODS-2013-AmelootBW #power of
On the expressive power of update primitives (TJA, JVdB, EW), pp. 139–150.
PODSPODS-2013-Figueira #testing #transitive #xpath
On XPath with transitive axes and data tests (DF), pp. 249–260.
PODSPODS-2013-GogaczM
On the BDD/FC conjecture (TG, JM), pp. 127–138.
SIGMODSIGMOD-2013-LongWYJ #worst-case
On optimal worst-case matching (CL, RCWW, PSY, MJ), pp. 845–856.
SIGMODSIGMOD-2013-MoerkotteFE
On the correct and complete enumeration of the core search space (GM, PF, ME), pp. 493–504.
SIGMODSIGMOD-2013-QiaoSDQSGCSZABBGGIJLPRSSSSTTWZ #distributed #framework #platform
On brewing fresh espresso: LinkedIn’s distributed data serving platform (LQ, KS, SD, TQ, BS, BG, AC, OS, ZZ, AA, CB, GB, MG, KG, WI, SJ, SL, AP, AR, AS, RS, SS, YS, ST, CT, JW, DZ), pp. 1135–1146.
TPDLTPDL-2013-KellyBWN
On the Change in Archivability of Websites Over Time (MK, JFB, MCW, MLN), pp. 35–47.
VLDBVLDB-2013-DengF #complexity #query
On the Complexity of Query Result Diversification (TD, WF), pp. 577–588.
VLDBVLDB-2013-FuKR #scalability
On Scaling Up Sensitive Data Auditing (YF, RK, RR), pp. 313–324.
VLDBVLDB-2013-KornSSY #problem
On Repairing Structural Problems In Semi-structured Data (FK, BS, DS, SY), pp. 601–612.
VLDBVLDB-2013-ZhaoCSZZ #random
On the Embeddability of Random Walk Distances (XZ, AC, ADS, HZ, BYZ), pp. 1690–1701.
ITiCSEITiCSE-2013-Luxton-ReillyDKTY #difference #student
On the differences between correct student solutions (ALR, PD, DK, EDT, SYY), pp. 177–182.
CSMRCSMR-2013-JaafarHGHA #empirical #evolution
On the Relationship between Program Evolution and Fault-Proneness: An Empirical Study (FJ, SH, YGG, SH, BA), pp. 15–24.
ICPCICPC-2013-BernhartG #code review #comprehension #source code
On the understanding of programs with continuous code reviews (MB, TG), pp. 192–198.
ICPCICPC-2013-PruijtKB #analysis #architecture #dependence
On the accuracy of Architecture Compliance Checking support Accuracy of dependency analysis and violation reporting (LP, CK, SB), pp. 172–181.
ICSMEICSM-2013-BazelliHS #stack overflow
On the Personality Traits of StackOverflow Users (BB, AH, ES), pp. 460–463.
ICSMEICSM-2013-MantylaKAEP #agile #testing
On Rapid Releases and Software Testing (MM, FK, BA, EE, KP), pp. 20–29.
ICSMEICSM-2013-MorenoBHM #debugging #source code
On the Relationship between the Vocabulary of Bug Reports and Source Code (LM, WB, SH, AM), pp. 452–455.
ICSMEICSM-2013-ShahDM #automation #java #refactoring
On the Automation of Dependency-Breaking Refactorings in Java (SMAS, JD, CM), pp. 160–169.
WCREWCRE-2013-IshioHKO #automation #effectiveness #feature model
On the effectiveness of accuracy of automated feature location technique (TI, SH, HK, TO), pp. 381–390.
WCREWCRE-2013-SohKGAA #maintenance
On the effect of program exploration on maintenance tasks (ZS, FK, YGG, GA, BA), pp. 391–400.
CIAACIAA-J-2012-KutribO13 #automaton #complexity
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
CIAACIAA-J-2012-Mohri13 #ambiguity #automaton #finite #functional #transducer
On the Disambiguation of Finite Automata and Functional Transducers (MM), pp. 847–862.
DLTDLT-J-2012-EsikO13 #context-free grammar #word
On Context-Free Languages of Scattered Words (ZÉ, SO), pp. 1029–1048.
CIAACIAA-2013-HasanIRS #automaton #sequence
On Palindromic Sequence Automata and Applications (MMH, ASMSI, MSR, AS), pp. 158–168.
CIAACIAA-2013-JirasekJ #bound #regular expression
On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
CIAACIAA-2013-KushikY #finite #nondeterminism #sequence #state machine
On the Length of Homing Sequences for Nondeterministic Finite State Machines (NK, NY), pp. 220–231.
DLTDLT-2013-Blanchet-SadriF #complexity #word
On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.
DLTDLT-2013-DayRS #problem
On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 167–178.
DLTDLT-2013-RampersadRS #word
On the Number of Abelian Bordered Words (NR, MR, PS), pp. 420–432.
ICALPICALP-v1-2013-AvisT #combinator #complexity
On the Extension Complexity of Combinatorial Polytopes (DA, HRT), pp. 57–68.
ICALPICALP-v1-2013-BohlerCKLPZ #complexity #diagrams #higher-order
On the Complexity of Higher Order Abstract Voronoi Diagrams (CB, PC, RK, CHL, EP, MZ), pp. 208–219.
ICALPICALP-v1-2013-BulanekKS #online #random
On Randomized Online Labeling with Polynomially Many Labels (JB, MK, MES), pp. 291–302.
ICALPICALP-v1-2013-CheriyanGGS #symmetry
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy (JC, ZG, KG, SS), pp. 340–351.
ICALPICALP-v1-2013-FotakisT #game studies #power of
On the Power of Deterministic Mechanisms for Facility Location Games (DF, CT), pp. 449–460.
ICALPICALP-v1-2013-HirtR #complexity
On the Complexity of Broadcast Setup (MH, PR), pp. 552–563.
ICALPICALP-v1-2013-IndykR #matrix #modelling
On Model-Based RIP-1 Matrices (PI, IR), pp. 564–575.
ICALPICALP-v2-2013-CelisGK #information management
On Revenue Maximization for Agents with Costly Information Acquisition — Extended Abstract (LEC, DCG, ARK), pp. 484–495.
ICALPICALP-v2-2013-DemriDS #complexity #verification
On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.
LATALATA-2013-AlurKTY #complexity #graph #problem
On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.
LATALATA-2013-BabaaliK #automaton #product line
On the Construction of a Family of Automata That Are Generically Non-minimal (PB, CK), pp. 80–91.
LATALATA-2013-FreivaldsZP #automaton #complexity
On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.
LATALATA-2013-GocMS
On the Number of Unbordered Factors (DG, HM, JS), pp. 299–310.
LATALATA-2013-IbarraR #automaton #bound
On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
TLCATLCA-2013-Schopp #continuation #interactive
On Interaction, Continuations and Defunctionalization (US), pp. 205–220.
FDGFDG-2013-Bjork #game studies
On the foundations of digital games (SB), pp. 1–8.
FDGFDG-2013-Ekman #artificial reality #game studies #pervasive
On the desire to not kill your players: Rethinking sound in pervasive and mixed reality games (IE), pp. 142–149.
FDGFDG-2013-Marklund #development #game studies #learning
On the development of learning games (BBM), pp. 474–476.
FDGFDG-2013-Myers #game studies
On the absence of imaginative resistance in games (DM), pp. 26–30.
CHICHI-2013-JuhlinO #collaboration #design #gesture #interactive
On the relation of ordinary gestures to TV screens: general lessons for the design of collaborative interactive techniques (OJ, EÖ), pp. 919–930.
HCIDUXU-PMT-2013-FaroughiF #design
On the Poetry of Design (AF, RF), pp. 38–47.
HCIHIMI-D-2013-ChangSCH #design #interface #layout #performance #topic
On the Reading Performance of Text Layout, Switch Position, Topic of Text, and Luminance Contrast for Chinese E-books Interface Design (WTC, LHS, ZC, KCH), pp. 567–575.
HCIHIMI-LCCB-2013-LeeCSJ
On Services and Insights of Technology Intelligence System (SL, MHC, SKS, HJ), pp. 579–587.
CAiSECAiSE-2013-Henderson-SellersCG #modelling
On the Search for a Level-Agnostic Modelling Language (BHS, TC, CGP), pp. 240–255.
ICEISICEIS-J-2013-Heusinger13a #design #research
On the “Impossibility” of Critical and Emancipatory Design Science Research (JMH), pp. 331–348.
CIKMCIKM-2013-AlbakourMO #effectiveness #microblog #realtime
On sparsity and drift for effective real-time filtering in microblogs (MDA, CM, IO), pp. 419–428.
CIKMCIKM-2013-Eklund #challenge #game studies #lessons learnt #mobile #perspective
On challenges with mobile e-health: lessons from a game-theoretic perspective (AME), pp. 1249–1252.
CIKMCIKM-2013-LiaoPPL #behaviour #mining #mobile #predict #smarttech
On mining mobile apps usage behavior for predicting apps usage in smartphones (ZXL, YCP, WCP, PRL), pp. 609–618.
CIKMCIKM-2013-LiMWLX #network #online #predict #social
On popularity prediction of videos shared in online social networks (HL, XM, FW, JL, KX), pp. 169–178.
CIKMCIKM-2013-ParikhSH #query #segmentation
On segmentation of eCommerce queries (NP, PS, MAH), pp. 1137–1146.
CIKMCIKM-2013-ZhouLSCJ #metric #reliability
On the reliability and intuitiveness of aggregated search metrics (KZ, ML, TS, RC, JMJ), pp. 689–698.
ECIRECIR-2013-MarkovAC13a
On CORI Results Merging (IM, AA, FC), pp. 752–755.
ICMLICML-c3-2013-HoXV #learning #taxonomy
On A Nonlinear Generalization of Sparse Coding and Dictionary Learning (JH, YX, BCV), pp. 1480–1488.
ICMLICML-c3-2013-JiaVD
On Compact Codes for Spatially Pooled Features (YJ, OV, TD), pp. 549–557.
ICMLICML-c3-2013-KamyshanskaM
On autoencoder scoring (HK, RM), pp. 720–728.
ICMLICML-c3-2013-KarS0K #algorithm #learning #online
On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions (PK, BKS, PJ, HK), pp. 441–449.
ICMLICML-c3-2013-KontorovichNW #learning
On learning parametric-output HMMs (AK, BN, RW), pp. 702–710.
ICMLICML-c3-2013-MenonNAC #algorithm #classification #consistency #statistics
On the Statistical Consistency of Algorithms for Binary Classification under Class Imbalance (AKM, HN, SA, SC), pp. 603–611.
ICMLICML-c3-2013-PascanuMB #network
On the difficulty of training recurrent neural networks (RP, TM, YB), pp. 1310–1318.
ICMLICML-c3-2013-SutskeverMDH #learning
On the importance of initialization and momentum in deep learning (IS, JM, GED, GEH), pp. 1139–1147.
KDDKDD-2013-CaiQ #analysis #linear #rank
On the equivalent of low-rank linear regressions and linear discriminant analysis based regressions (XC, CHQD, FN, HH), pp. 1124–1132.
KDDKDD-2013-CiglanLN #community #detection #network
On community detection in real-world networks and the importance of degree assortativity (MC, ML, KN), pp. 1007–1015.
KDIRKDIR-KMIS-2013-NcirE #clustering #question
On the Extension of k-Means for Overlapping Clustering — Average or Sum of Clusters’ Representatives? (CEBN, NE), pp. 208–213.
SEKESEKE-2013-Kung #case study #identification
On Use Case Identification (DCK), pp. 759–764.
SEKESEKE-2013-ZhangLK #debugging #statistics #using
On the Use of Bug and Predicate Signatures for Statistical Debugging (YZ, EL, BK), pp. 249–299.
SIGIRSIGIR-2013-McParlaneMJ #recommendation
On contextual photo tag recommendation (PJM, YM, JMJ), pp. 965–968.
SIGIRSIGIR-2013-UrbanoMM #metric #reliability
On the measurement of test collection reliability (JU, MM, DM), pp. 393–402.
BXBX-2013-OrejasBE0S #concurrent
On Propagation-Based Concurrent Model Synchronization (FO, AB, HE, FH, HS), pp. 18–36.
ICMTICMT-2013-HermannGNBMPE #automation #graph grammar #using
On an Automated Translation of Satellite Procedures Using Triple Graph Grammars (FH, SG, NN, BB, GM, AP, TE), pp. 50–51.
MODELSMoDELS-2013-HebigGSS #evolution
On the Complex Nature of MDE Evolution (RH, HG, FS, AS), pp. 436–453.
PADLPADL-2013-0004R #implementation #performance
On the Efficient Implementation of Mode-Directed Tabling (JS, RR), pp. 141–156.
POPLPOPL-2013-Ben-AmramG #constraints #integer #linear #problem #ranking
On the linear ranking problem for integer linear-constraint loops (AMBA, SG), pp. 51–62.
SASSAS-2013-BjornerMR #horn clause #quantifier
On Solving Universally Quantified Horn Clauses (NB, KLM, AR), pp. 105–125.
REER-BR-2013-SantosW #communication #ecosystem #requirements
On the Impact of Software Ecosystems in Requirements Communication and Management (RPdS, CMLW).
RERE-2013-GhezziMSS #requirements #verification
On requirements verification for model refinements (CG, CM, AMS, PS), pp. 62–71.
SACSAC-OOPS-J-2009-BettiniCD13 #flexibility #java
On flexible dynamic trait replacement for Java-like languages (LB, SC, FD), pp. 907–932.
ICSEICSE-2013-Khalid #identification
On identifying user complaints of iOS apps (HK), pp. 1474–1476.
ICSEICSE-2013-Kuhn #interactive #live programming #programming #testing
On extracting unit tests from interactive live programming sessions (AK), pp. 1241–1244.
ICSEICSE-2013-RahmanARP #case study
On the relationships between domain-based coupling and code clones: an exploratory study (MSR, AA, CKR, FP), pp. 1265–1268.
ICSEICSE-2013-SayyadMA #case study #product line #re-engineering #search-based
On the value of user preferences in search-based software engineering: a case study in software product lines (ASS, TM, HA), pp. 492–501.
SACSAC-2013-AccorsiSM #mining #process #security
On the exploitation of process mining for security audits: the process discovery case (RA, TS, GM), pp. 1462–1468.
SACSAC-2013-DermevalCSPBBETS #architecture #design #metamodelling #requirements #using
On the use of metamodeling for relating requirements and architectural design decisions (DD, JC, CTLLS, JP, IIB, PHdSB, EE, TT, APdS), pp. 1278–1283.
SACSAC-2013-GoncalvesEPSKS #distributed #network
On the load balancing of virtual networks in distributed clouds (GEG, PTE, AVdAP, MAS, JK, DS), pp. 625–631.
SACSAC-2013-OliveiraB #configuration management
On the reconfiguration of software connectors (NO, LSB), pp. 1885–1892.
SACSAC-2013-VukovicD #distributed #estimation #security
On the security of distributed power system state estimation under targeted attacks (OV, GD), pp. 666–672.
GPCEGPCE-2013-KurilovaR #data type #linked data #open data
On the simplicity of synthesizing linked data structure operations (DK, DR), pp. 155–158.
CASECASE-2013-KimM #equilibrium #random
On the equilibrium probabilities of deterministic flow lines with random arrivals (WsK, JRM), pp. 723–729.
CCCC-2013-BertschNS #lr #parsing
On LR Parsing with Selective Delays (EB, MJN, SS), pp. 244–263.
CCCC-2013-CammarotaNVKDM #optimisation
On the Determination of Inlining Vectors for Program Optimization (RC, AN, AVV, AK, DD, MM), pp. 164–183.
CGOCGO-2013-RuanLWS #framework #platform
On the platform specificity of STM instrumentation mechanisms (WR, YL, CW, MFS), p. 10.
DACDAC-2013-CarloYM #3d #delivery #induction #integration #power management
On the potential of 3D integration of inductive DC-DC converter for high-performance power delivery (SC, WY, SM), p. 8.
DACDAC-2013-GirbalMGAQCY #convergence
On the convergence of mainstream and mission-critical markets (SG, MM, AG, JA, EQ, FJC, SY), p. 10.
DACDAC-2013-JiangYXCE #3d #effectiveness #performance
On effective and efficient in-field TSV repair for stacked 3D ICs (LJ, FY, QX, KC, BE), p. 6.
DACDAC-2013-LiuC #synthesis
On learning-based methods for design-space exploration with high-level synthesis (HYL, LPC), p. 7.
DACDAC-2013-XuWHRT #estimation #performance #robust
On robust task-accurate performance estimation (YX, BW, RH, RR, JT), p. 6.
DACDAC-2013-YuanLJX #testing
On testing timing-speculative circuits (FY, YL, WBJ, QX), p. 6.
DATEDATE-2013-BertaccoCBFVKP #using
On the use of GP-GPUs for accelerating compute-intensive EDA applications (VB, DC, NB, FF, SV, AMK, HDP), pp. 1357–1366.
DATEDATE-2013-ChiangTWHCDN #array #configuration management #order #synthesis #using
On reconfigurable single-electron transistor arrays synthesis using reordering techniques (CEC, LFT, CYW, CYH, YCC, SD, VN), pp. 1807–1812.
DATEDATE-2013-Pomeranz #equivalence #fault #graph #set
On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.
HPDCHPDC-2013-AjiPJCMBBDFMMT
On the efficacy of GPU-integrated MPI for scientific applications (AMA, LSP, FJ, MC, KM, PB, KRB, JD, WcF, JMMC, XM, RT), pp. 191–202.
ESOPESOP-2013-PetersNG #calculus #process
On Distributability in Process Calculi (KP, UN, UG), pp. 310–329.
FASEFASE-2013-HaslingerLE #feature model #modelling #set
On Extracting Feature Models from Sets of Valid Feature Combinations (ENH, RELH, AE), pp. 53–67.
FASEFASE-2013-HoferRWAG #empirical #evaluation #fault #locality #spreadsheet
On the Empirical Evaluation of Fault Localization Techniques for Spreadsheets (BH, AR, FW, RA, EG), pp. 68–82.
FoSSaCSFoSSaCS-2013-BauerHK #higher-order #monad #parametricity
On Monadic Parametricity of Second-Order Functionals (AB, MH, AK), pp. 225–240.
FoSSaCSFoSSaCS-2013-DreierELL #composition #process #π-calculus
On Unique Decomposition of Processes in the Applied π-Calculus (JD, CE, PL, YL), pp. 50–64.
STOCSTOC-2013-BeiCZ #complexity #fault
On the complexity of trial and error (XB, NC, SZ), pp. 31–40.
STOCSTOC-2013-Ben-SassonCGT #performance #proving
On the concrete efficiency of probabilistically-checkable proofs (EBS, AC, DG, ET), pp. 585–594.
STOCSTOC-2013-BitanskyP #approximate #encryption #obfuscation
On the impossibility of approximate obfuscation and applications to resettable cryptography (NB, OP), pp. 241–250.
STOCSTOC-2013-Wootters #fault #linear #random #scalability
On the list decodability of random linear codes with large error rates (MW), pp. 853–860.
CSLCSL-2013-AfshariL #calculus #μ-calculus
On closure ordinals for the modal μ-calculus (BA, GEL), pp. 30–44.
CSLCSL-2013-HarwathS #first-order #invariant #locality #logic #quantifier
On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.
CSLCSL-2013-Mellies #game studies
On dialogue games and coherent strategies (PAM), pp. 540–562.
ICLPICLP-J-2013-BartholomewL #semantics
On the stable model semantics for intensional functions (MB, JL), pp. 863–876.
LICSLICS-2013-FereeHG #complexity #query
On the Query Complexity of Real Functionals (HF, MH, WG), pp. 103–112.
LICSLICS-2013-LerouxPS #problem
On the Context-Freeness Problem for Vector Addition Systems (JL, VP, GS), pp. 43–52.
LICSLICS-2013-MogaveroMS #behaviour #bound
On the Boundary of Behavioral Strategies (FM, AM, LS), pp. 263–272.
ICSTSAT-2013-Gableske #heuristic #message passing #satisfiability
On the Interpolation between Product-Based Message Passing Heuristics for SAT (OG), pp. 293–308.
ICSTSAT-2013-JanotaM
On Propositional QBF Expansions and Q-Resolution (MJ, JMS), pp. 67–82.
ICSTSAT-2013-Toran #complexity #graph #morphism
On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.
WICSA-ECSAWICSA-ECSA-2012-HilliardMMP #architecture #composition #framework #reuse #using
On the Composition and Reuse of Viewpoints across Architecture Frameworks (RH, IM, HM, PP), pp. 131–140.
HTHT-2012-RecueroA #topic #twitter
On the rise of artificial trending topics in twitter (RR, RA), pp. 305–306.
JCDLJCDL-2012-MarshallS #social #social media
On the institutional archiving of social media (CCM, FMSI), pp. 1–10.
PODSPODS-2012-DengFG #complexity #problem #recommendation
On the complexity of package recommendation problems (TD, WF, FG), pp. 261–272.
PODSPODS-2012-XuT #clustering
On the optimality of clustering properties of space filling curves (PX, ST), pp. 215–224.
TPDLTPDL-2012-DalipGCC #assessment #automation #multi #quality #wiki
On MultiView-Based Meta-learning for Automatic Quality Assessment of Wiki Articles (DHD, MAG, MC, PC), pp. 234–246.
VLDBVLDB-2012-LappasVGT
On The Spatiotemporal Burstiness of Terms (TL, MRV, DG, VJT), pp. 836–847.
VLDBVLDB-2013-ZengNC12 #mining
On differentially private frequent itemset mining (CZ, JFN, JYC), pp. 25–36.
ITiCSEITiCSE-2012-HiltonJ #array #education #learning #testing
On teaching arrays with test-driven learning in WebIDE (MH, DSJ), pp. 93–98.
CSMRCSMR-2012-BertranAGCS #architecture #identification
On the Relevance of Code Anomalies for Identifying Architecture Degradation Symptoms (IMB, RA, AG, CC, AvS), pp. 277–286.
CSMRCSMR-2012-MurtazaSHC #comparison #identification #kernel
On the Comparison of User Space and Kernel Space Traces in Identification of Software Anomalies (SSM, AS, AHL, MC), pp. 127–136.
SCAMSCAM-2012-HillRK #debugging #java #locality #using
On the Use of Stemming for Concern Location and Bug Localization in Java (EH, SR, ACK), pp. 184–193.
WCREWCRE-2012-BrunetBGF #architecture
On the Evolutionary Nature of Architectural Violations (JB, RAB, DSG, JCAdF), pp. 257–266.
AFLAFL-J-2011-FazekasLS12 #context-free grammar
On Non-Primitive Palindromic Context-Free Languages (SZF, PL, KST), pp. 1277–1290.
DLTDLT-J-2011-BrodaMMR12 #automaton
On the Average Size of Glushkov and Partial derivative Automata (SB, AM, NM, RR), pp. 969–984.
CIAACIAA-2012-HeamHK #bound #constraints
On Positive TAGED with a Bounded Number of Constraints (PCH, VH, OK), pp. 329–336.
CIAACIAA-2012-JiraskovaM #complexity
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
CIAACIAA-2012-KutribO #automaton #complexity
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.
DLTDLT-2012-EsikO #context-free grammar #word
On Context-Free Languages of Scattered Words (ZÉ, SO), pp. 142–153.
DLTDLT-2012-FlickK
On a Hierarchy of Languages with Catenation and Shuffle (NEF, MK), pp. 452–458.
DLTDLT-2012-GandhiKL #complexity #finite #word
On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
DLTDLT-2012-Otto #component
On Centralized PC Grammar Systems with Context-Sensitive Components (FO), pp. 356–367.
ICALPICALP-v1-2012-BhaskaraCMV #polynomial #programming
On Quadratic Programming with a Ratio Objective (AB, MC, RM, AV), pp. 109–120.
ICALPICALP-v1-2012-SanthanamS
On the Limits of Sparsification (RS, SS), pp. 774–785.
ICALPICALP-v2-2012-BaldeschiHLS #keyword #multi
On Multiple Keyword Sponsored Search Auctions with Budgets (RCB, MH, SL, MS), pp. 1–12.
ICALPICALP-v2-2012-Barenboim #locality #problem
On the Locality of Some NP-Complete Problems (LB), pp. 403–415.
ICALPICALP-v2-2012-KuperbergB #infinity #logic #power of #word
On the Expressive Power of Cost Logics over Infinite Words (DK, MVB), pp. 287–298.
LATALATA-2012-MeierSTV #complexity #logic
On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
LATALATA-2012-SaloT #automaton #finite #product line #set
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
LATALATA-2012-TangO #automaton #model checking
On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.
RTARTA-2012-AccattoliL #cost analysis #reduction
On the Invariance of the Unitary Cost Model for Head Reduction (BA, UDL), pp. 22–37.
RTARTA-2012-BertrandDKSS #decidability #graph transformation #reachability
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.
RTARTA-2012-GmeinerGS #term rewriting
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.
RTARTA-2012-ThiemannAN #formal method #multi #order #termination
On the Formalization of Termination Techniques based on Multiset Orderings (RT, GA, JN), pp. 339–354.
ICFPICFP-2012-EndrullisHB #complexity #equivalence #infinity #specification
On the complexity of equivalence of specifications of infinite objects (JE, DH, RB), pp. 153–164.
AIIDEAIIDE-2012-BulitkoRL #heuristic #realtime
On Case Base Formation in Real-Time Heuristic Search (VB, DCR, RL).
CHICHI-2012-HuhnKLK #evaluation #using
On the use of virtual environments for the evaluation of location-based applications (AEH, VJK, AL, PK), pp. 2569–2578.
CHICHI-2012-McCay-PeetLN
On saliency, affect and focused attention (LMP, ML, VN), pp. 541–550.
CSCWCSCW-2012-GrubbB #enterprise #information management
On the perceived interdependence and information sharing inhibitions of enterprise software engineers (AMG, AB), pp. 1337–1346.
CAiSECAiSE-2012-BinderDDDFGGHHRRW #case study #clustering #experience #process
On Analyzing Process Compliance in Skin Cancer Treatment: An Experience Report from the Evidence-Based Medical Compliance Cluster (EBMC2) (MB, WD, GD, RD, KAF, WG, WG, KH, MH, SRM, CR, SW), pp. 398–413.
CIKMCIKM-2012-BabbarPGA #classification #empirical #scalability #trade-off
On empirical tradeoffs in large scale hierarchical classification (RB, IP, ÉG, CA), pp. 2299–2302.
CIKMCIKM-2012-ChengZXAC #classification #learning
On active learning in hierarchical classification (YC, KZ, YX, AA, ANC), pp. 2467–2470.
CIKMCIKM-2012-Cummins #precise
On the inference of average precision from score distributions (RC), pp. 2435–2438.
CIKMCIKM-2012-HofmannBR #bias
On caption bias in interleaving experiments (KH, FB, FR), pp. 115–124.
CIKMCIKM-2012-HwangLKL #performance #recommendation #using
On using category experts for improving the performance and accuracy in recommender systems (WSH, HJL, SWK, ML), pp. 2355–2358.
CIKMCIKM-2012-Li0HRD
On skyline groups (CL, NZ, NH, SR, GD), pp. 2119–2123.
CIKMCIKM-2012-LiuKCBLPR #graph
On compressing weighted time-evolving graphs (WL, AK, JC, JB, CL, JP, KR), pp. 2319–2322.
CIKMCIKM-2012-LiuW #analysis #semantics
On the connections between explicit semantic analysis and latent semantic analysis (CL, YMW), pp. 1804–1808.
CIKMCIKM-2012-MacdonaldSO #learning #query #rank
On the usefulness of query features for learning to rank (CM, RLTS, IO), pp. 2559–2562.
CIKMCIKM-2012-MoghaddamE #design #mining #modelling
On the design of LDA models for aspect-based opinion mining (SM, ME), pp. 803–812.
CIKMCIKM-2012-Sadri #integration #probability
On the foundations of probabilistic information integration (FS), pp. 882–891.
CIKMCIKM-2012-YangLCYH #network #social
On bundle configuration for viral marketing in social networks (DNY, WCL, NHC, MY, HJH), pp. 2234–2238.
ECIRECIR-2012-AtilganAU #keyword #xml
On the Size of Full Element-Indexes for XML Keyword Search (DA, ISA, ÖU), pp. 556–560.
ECIRECIR-2012-CumminsO #information retrieval
On Theoretically Valid Score Distributions in Information Retrieval (RC, CO), pp. 451–454.
ECIRECIR-2012-HosseiniCMKV #documentation #multi
On Aggregating Labels from Multiple Crowd Workers to Infer Relevance of Documents (MH, IJC, NMF, GK, VV), pp. 182–194.
ECIRECIR-2012-NeumayerBN #ad hoc #modelling #web
On the Modeling of Entities for Ad-Hoc Entity Search in the Web of Data (RN, KB, KN), pp. 133–145.
ECIRECIR-2012-Robertson #precise
On Smoothing Average Precision (SR), pp. 158–169.
ICMLICML-2012-AzarMK #complexity #generative #learning
On the Sample Complexity of Reinforcement Learning with a Generative Model (MGA, RM, BK), p. 222.
ICMLICML-2012-BachLO #algorithm #equivalence
On the Equivalence between Herding and Conditional Gradient Algorithms (FRB, SLJ, GO), p. 176.
ICMLICML-2012-BowlingZ
On Local Regret (MB, MZ), p. 56.
ICMLICML-2012-HazanJ #random
On the Partition Function and Random Maximum A-Posteriori Perturbations (TH, TSJ), p. 217.
ICMLICML-2012-HeKC #nearest neighbour
On the Difficulty of Nearest Neighbor Search (JH, SK, SFC), p. 9.
ICMLICML-2012-Memisevic #learning #multi
On multi-view feature learning (RM), p. 140.
ICMLICML-2012-ScholkopfJPSZM #learning
On causal and anticausal learning (BS, DJ, JP, ES, KZ, JMM), p. 63.
ICMLICML-2012-SunGS #kernel #online #taxonomy
On the Size of the Online Kernel Sparsification Dictionary (YS, FJG, JS), p. 79.
ICPRICPR-2012-Al-KhaffafSCB #performance #re-engineering
On the performance of Decapod’s digital font reconstruction (HSMAK, FS, MPC, TMB), pp. 649–652.
ICPRICPR-2012-ChaudhuriM
On the relation between K-means and PLSA (ARC, MNM), pp. 2298–2301.
ICPRICPR-2012-ConnollyGS #classification #correlation
On the correlation between genotype and classifier diversity (JFC, EG, RS), pp. 1068–1071.
ICPRICPR-2012-KovalenkoS
On methods for incorporating evidences into posterior scoring of hypotheses (DK, SNS), pp. 577–580.
ICPRICPR-2012-MatovskiNMM #automation #quality #recognition
On including quality in applied automatic gait recognition (DSM, MSN, SM, TM), pp. 3272–3275.
KDDKDD-2012-AbrahaoSHK #community
On the separability of structural classes of communities (BDA, SS, JEH, RK), pp. 624–632.
KDDKDD-2012-SpeiserALS
On nested palindromes in clickstream data (MS, GA, AL, JS), pp. 1460–1468.
KDDKDD-2012-WuALYY
On “one of the few” objects (YW, PKA, CL, JY, CY), pp. 1487–1495.
KDDKDD-2012-YangSLC #network #query #social
On socio-spatial group query for location-based social networks (DNY, CYS, WCL, MSC), pp. 949–957.
KDIRKDIR-2012-BelliniCN #effectiveness #information retrieval #optimisation
On the Effectiveness and Optimization of Information Retrieval for Cross Media Content (PB, DC, PN), pp. 344–347.
KDIRKDIR-2012-SantosNF #generative
On the Generation of Dynamic Business Indicators (FAPdS, RCdN, JBF), pp. 390–394.
KMISKMIS-2012-WangK #development #framework
On the Development of a Theoretical Framework for New Product Development (LW, AK), pp. 49–59.
KRKR-2012-BordeauxJSM #quantifier
On Unit-Refutation Complete Formulae with Existentially Quantified Variables (LB, MJ, JPMS, PM).
KRKR-2012-OetschPPST #source code #testing
On the Small-Scope Hypothesis for Testing Answer-Set Programs (JO, MP, JP, MS, HT).
RecSysRecSys-2012-YangSGL #network #recommendation #social #using
On top-k recommendation using social networks (XY, HS, YG, YL), pp. 67–74.
SEKESEKE-2012-Devanbu
On the Naturalness of Software (PTD).
SIGIRSIGIR-2012-LimSG #trade-off
On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off (KWL, SS, SG), pp. 1117–1118.
SIGIRSIGIR-2012-McCreadieSLMOM #corpus #reuse #twitter
On building a reusable Twitter corpus (RM, IS, JL, CM, IO, DM), pp. 1113–1114.
SIGIRSIGIR-2012-RobertsonK #evaluation #information retrieval #topic
On per-topic variance in IR evaluation (SER, EK), pp. 891–900.
SIGIRSIGIR-2012-RobertsonK12a #ad hoc #evaluation #realtime #retrieval
On real-time ad-hoc retrieval evaluation (SER, EK), pp. 1119–1120.
SIGIRSIGIR-2012-WoodwardXN #automation #documentation #web
On automatically tagging web documents from examples (NJW, WX, KN), pp. 1111–1112.
SIGIRSIGIR-2012-YilmazKCT
On judgments obtained from a commercial search engine (EY, GK, NC, SMMT), pp. 1115–1116.
ECMFAECMFA-2012-GuyCDSJ #type system
On Model Subtyping (CG, BC, SD, JS, JMJ), pp. 400–415.
MODELSMoDELS-2012-ButtnerEC #atl #off the shelf #smt #using #verification
On Verifying ATL Transformations Using “off-the-shelf” SMT Solvers (FB, ME, JC), pp. 432–448.
MODELSMoDELS-2012-HamannHG #behaviour #modelling #ocl
On Integrating Structure and Behavior Modeling with OCL (LH, OH, MG), pp. 235–251.
OOPSLAOOPSLA-2012-CastanosEINNOW #compilation #jit #scripting language #static typing
On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages (JGC, DE, KI, PN, TN, TO, PW), pp. 195–212.
POPLPOPL-2012-CretinR #abstraction #power of
On the power of coercion abstraction (JC, DR), pp. 361–372.
SASSAS-2012-Alonso-BlasG #approach #cost analysis
On the Limits of the Classical Approach to Cost Analysis (DEAB, SG), pp. 405–421.
RERE-2012-Knauss #ecosystem #elicitation #requirements
On the usage of context for requirements elicitation: End-user involvement in IT ecosystems (AK), pp. 345–348.
RERE-2012-LiaskosJA #elicitation #metric #modelling
On eliciting contribution measures in goal models (SL, RJ, JA), pp. 221–230.
ICSEICSE-2012-HindleBSGD
On the naturalness of software (AH, ETB, ZS, MG, PTD), pp. 837–847.
ICSEICSE-2012-Jaafar #analysis #evolution #source code
On the analysis of evolution of software artefacts and programs (FJ), pp. 1563–1566.
ICSEICSE-2012-NovaisNLCDGM #comprehension #evolution #industrial #interactive #visualisation
On the proactive and interactive visualization for feature evolution comprehension: An industrial investigation (RLN, CN, CANL, EC, FD, AG, MGM), pp. 1044–1053.
ICSEICSE-2012-SchwarzLR #how #repository
On how often code is cloned across repositories (NS, ML, RR), pp. 1289–1292.
SACSAC-2012-AccorsiS #consistency #mining #process #security
On the exploitation of process mining for security audits: the conformance checking case (RA, TS), pp. 1709–1716.
SACSAC-2012-Affeldt #library #low level
On construction of a library of formally verified low-level arithmetic functions (RA), pp. 1326–1331.
SACSAC-2012-ArpiniA #behaviour #enterprise #modelling
On the support for the assignment of active structure and behavior in enterprise modeling approaches (RHA, JPAA), pp. 1686–1693.
SACSAC-2012-CombiP #complexity #workflow
On the complexity of temporal controllabilities for workflow schemata (CC, RP), pp. 60–66.
SACSAC-2012-NathML #classification #fault #testing
On the improvement of a fault classification scheme with implications for white-box testing (SKN, RM, MFL), pp. 1123–1130.
SACSAC-2012-OliveiraCS #bound #using
On using adversary simulators to obtain tight lower bounds for response times (RSdO, AC, RAS), pp. 1573–1579.
SACSAC-2012-TarauH
On computing with types (PT, DH), pp. 1889–1896.
SLESLE-2012-DuranZT #domain-specific language #non-functional #reuse #specification
On the Reusable Specification of Non-functional Properties in DSLs (FD, SZ, JT), pp. 332–351.
CASECASE-2012-GhonaimGS #problem
On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources (WG, HG, WS), pp. 341–346.
CASECASE-2012-HouLZ #petri net
On iterative liveness-enforcement for a class of generalized Petri nets (YH, DL, MZ), pp. 188–193.
CASECASE-2012-KimM #modelling #probability #random #throughput
On the throughput of deterministic flow lines with random state dependent setups: Stochastic models and applications (WsK, JRM), pp. 650–655.
CASECASE-2012-KlotzSSFTS #verification
On the formal verification of routing in material handling systems (TK, NS, BS, EF, KT, JS), pp. 8–13.
CASECASE-2012-KobayashiH #automaton
On opacity and diagnosability in discrete event systems modeled by pushdown automata (KK, KH), pp. 662–667.
CASECASE-2012-SawadaS #design #feedback #optimisation
On numerical optimization design of continuous-time feedback type quantizer for networked control systems (KS, SS), pp. 1144–1149.
DACDAC-2012-ForteS #proximity
On improving the uniqueness of silicon-based physically unclonable functions via optical proximity correction (DF, AS), pp. 96–105.
DACDAC-2012-KarakonstantisRBB #fault
On the exploitation of the inherent error resilience of wireless systems under unreliable silicon (GK, CR, CB, AB), pp. 510–515.
DACDAC-2012-SloanSK #design #probability
On software design for stochastic processors (JS, JS, RK), pp. 918–923.
DACDAC-2012-YorkC #multi
On the asymptotic costs of multiplexer-based reconfigurability (JY, DC), pp. 790–795.
DATEDATE-2012-HsuCCLC #effectiveness #pseudo
On effective flip-chip routing via pseudo single redistribution layer (HWH, MLC, HMC, HCL, SHC), pp. 1597–1602.
DATEDATE-2012-JiangSCBP #algorithm #constraints #generative #memory management
On the optimality of K longest path generation algorithm under memory constraints (JJ, MS, AC, BB, IP), pp. 418–423.
DATEDATE-2012-JiangXE #3d #effectiveness
On effective TSV repair for 3D-stacked ICs (LJ, QX, BE), pp. 793–798.
DATEDATE-2012-RamboHS #consistency #memory management #multi #verification
On ESL verification of memory consistency for system-on-chip multiprocessing (EAR, OPH, LCVdS), pp. 9–14.
DATEDATE-2012-SchmutzlerSB
On demand dependent deactivation of automotive ECUs (CS, MS, JB), pp. 69–74.
PDPPDP-2012-IlicS #distributed #scheduling
On Realistic Divisible Load Scheduling in Highly Heterogeneous Distributed Systems (AI, LS), pp. 426–433.
PDPPDP-2012-PopovBF
On the Influence of PRNGs on Data Distribution (IP, AB, TF), pp. 536–543.
PDPPDP-2012-SteinbrecherS #optimisation #problem #sequence
On Optimizing the Longest Common Subsequence Problem by Loop Unrolling Along Wavefronts (JS, WS), pp. 603–611.
WRLAWRLA-J-2010-DuranM12 #order
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (FD, JM), pp. 816–850.
ESOPESOP-2012-HabermaierK #correctness #execution
On the Correctness of the SIMT Execution Model of GPUs (AH, AK), pp. 316–335.
FASEFASE-2012-StaatsGWH #generative #testing
On the Danger of Coverage Directed Test Case Generation (MS, GG, MWW, MPEH), pp. 409–424.
FoSSaCSFoSSaCS-2012-ChenBW #complexity #probability #similarity
On the Complexity of Computing Probabilistic Bisimilarity (DC, FvB, JW), pp. 437–451.
FoSSaCSFoSSaCS-2012-GlabbeekGS #petri net
On Distributability of Petri Nets — (RJvG, UG, JWSU), pp. 331–345.
FoSSaCSFoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #probability #problem
On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
FoSSaCSFoSSaCS-2012-KurzST #regular expression
On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.
STOCSTOC-2012-ChawlaIL #black box #design #reduction
On the limits of black-box reductions in mechanism design (SC, NI, BL), pp. 435–448.
STOCSTOC-2012-Chuzhoy
On vertex sparsifiers with Steiner nodes (JC), pp. 673–688.
STOCSTOC-2012-ForbesS #rank #testing
On identity testing of tensors, low-rank recovery and compressed sensing (MAF, AS), pp. 163–172.
STOCSTOC-2012-HuynhN #communication #complexity #proving #trade-off
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity (TH, JN), pp. 233–248.
CAVCAV-2012-GuhaNA #automaton #bisimulation #decidability
On Decidability of Prebisimulation for Timed Automata (SG, CN, SAK), pp. 444–461.
CSLCSL-2012-CarraroS #consistency #equation #formal method #modelling #λ-calculus
On the equational consistency of order-theoretic models of the λ-calculus (AC, AS), pp. 152–166.
ICLPICLP-2012-GrecoST #logic programming #source code #termination
On the Termination of Logic Programs with Function Symbols (SG, FS, IT), pp. 323–333.
LICSLICS-2012-BundalaOW #bound #model checking
On the Magnitude of Completeness Thresholds in Bounded Model Checking (DB, JO, JW), pp. 155–164.
LICSLICS-2012-ChenF #order
On the Ordered Conjecture (YC, JF), pp. 225–234.
LICSLICS-2012-Constable
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer (RLC), pp. 2–8.
LICSLICS-2012-Nigam #complexity #linear #logic
On the Complexity of Linear Authorization Logics (VN), pp. 511–520.
LICSLICS-2012-Parys
On the Significance of the Collapse Operation (PP), pp. 521–530.
ICSTSAT-2012-BelovIMM #performance
On Efficient Computation of Variable MUSes (AB, AI, AM, JMS), pp. 298–311.
ICSTSAT-2012-Egly
On Sequent Systems and Resolution for QBFs (UE), pp. 100–113.
ICSTSAT-2012-KullmannZ #reduction #satisfiability
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
SMTSMT-2012-KovasznaiFB #complexity #logic
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (GK, AF, AB), pp. 44–56.
VMCAIVMCAI-2012-Ben-AmramGM #integer #termination
On the Termination of Integer Loops (AMBA, SG, ANM), pp. 72–87.
VMCAIVMCAI-2012-Bugaychenko #diagrams #model checking #multi #probability
On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking (DB), pp. 104–118.
ECSAECSA-2011-Axelsson #architecture #embedded #how #nondeterminism
On How to Deal with Uncertainty When Architecting Embedded Software and Systems (JA), pp. 199–202.
JCDLJCDL-2011-GollapalliGMC #identification #library
On identifying academic homepages for digital libraries (SDG, CLG, PM, CC), pp. 123–132.
PODSPODS-2011-AmsterdamerDMT
On provenance minimization (YA, DD, TM, VT), pp. 141–152.
PODSPODS-2011-HeBWN #complexity #privacy
On the complexity of privacy-preserving complex event processing (YH, SB, DW, JFN), pp. 165–174.
PODSPODS-2011-ShengT11a #memory management
On finding skylines in external memory (CS, YT), pp. 107–116.
SIGMODSIGMOD-2011-TaoSP
On k-skip shortest paths (YT, CS, JP), pp. 421–432.
VLDBVLDB-2011-RenLKZC #evolution #graph #query #sequence
On Querying Historical Evolving Graph Sequences (CR, EL, BK, XZ, RC), pp. 726–737.
VLDBVLDB-2011-SunCLCH #similarity
On Link-based Similarity Join (LS, RC, XL, DWC, JH), pp. 714–725.
VLDBVLDB-2011-WangYYZP #database #nondeterminism #ranking
On Pruning for Top-K Ranking in Uncertain Databases (CW, LYY, JHY, ORZ, JP), pp. 598–609.
VLDBVLDB-2011-YangCLC #constraints #query
On Social-Temporal Group Query with Acquaintance Constraint (DNY, YLC, WCL, MSC), pp. 397–408.
VLDBVLDB-2012-PavloJZ11 #execution #modelling #optimisation #parallel #predict #transaction
On Predictive Modeling for Optimizing Transaction Execution in Parallel OLTP Systems (AP, EPCJ, SBZ), pp. 85–96.
CSMRCSMR-2011-JunioMMNV #maintenance
On the Benefits of Planning and Grouping Software Maintenance Requests (GAJ, MNM, HMdA, HTMN, MTV), pp. 55–64.
CSMRCSMR-2011-MendeKP #case study #fault #integration #predict #testing
On the Utility of a Defect Prediction Model during HW/SW Integration Testing: A Retrospective Case Study (TM, RK, JP), pp. 259–268.
CSMRCSMR-2011-SilvaPAM #execution #using
On the Use of Execution Trace Alignment for Driving Perfective Changes (LLS, KRP, SdA, MdAM), pp. 221–230.
ICPCICPC-2011-EitanGHMW #comprehension #source code #visualisation
On Visualization and Comprehension of Scenario-Based Programs (NE, MG, DH, AM, GW), pp. 189–192.
ICPCICPC-2011-HaiducM #concept #query
On the Effect of the Query in IR-based Concept Location (SH, AM), pp. 234–237.
ICSMEICSM-2011-GethersOPL #information retrieval #orthogonal #traceability
On integrating orthogonal information retrieval methods to improve traceability recovery (MG, RO, DP, ADL), pp. 133–142.
ICSMEICSM-2011-ShevertalovM #maintenance
On the maintenance of UI-integrated mashup applications (MS, SM), pp. 203–212.
WCREWCRE-2011-UddinRSH #detection #effectiveness #scalability
On the Effectiveness of Simhash for Detecting Near-Miss Clones in Large Scale Software Systems (MSU, CKR, KAS, AH), pp. 13–22.
DLTDLT-J-2009-LehtinenO11 #equation #set
On Equations over Sets of Numbers and their Limitations (TL, AO), pp. 377–393.
CIAACIAA-J-2010-Birget11
On the Circuit-Size of inverses (JCB), pp. 1925–1938.
DLTDLT-J-2010-Berlinkov11
On a Conjecture by Carpi and d’Alessandro (MVB), pp. 1565–1576.
DLTDLT-J-2010-BrodaMMR11 #approach #automaton #combinator #complexity
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
DLTDLT-J-2010-KuppusamyMK11 #ambiguity
On the Ambiguity of Insertion Systems (LK, AM, KK), pp. 1747–1758.
DLTDLT-J-2010-Shur11
On the existence of Minimal β-powers (AMS), pp. 1683–1696.
AFLAFL-2011-Blanchet-SadriNT #word
On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
AFLAFL-2011-Choffrut #finite #infinity #word
On relations of finite words over infinite alphabets (CC), pp. 25–27.
AFLAFL-2011-MedunaVZ #nondeterminism
On Nondeterminism in Programmed Grammars (AM, LV, PZ), pp. 315–327.
CIAACIAA-2011-ChengJBK #synthesis
On the Hardness of Priority Synthesis (CHC, BJ, CB, AK), pp. 110–117.
CIAACIAA-2011-Ibarra #equivalence #linear #problem #transducer
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
DLTDLT-2011-FiciL #word
On Prefix Normal Words (GF, ZL), pp. 228–238.
DLTDLT-2011-GusevP #set
On Non-complete Sets and Restivo’s Conjecture (VVG, EVP), pp. 239–250.
DLTDLT-2011-IbarraY #transducer
On Two-Way Transducers (OHI, HCY), pp. 300–311.
DLTDLT-2011-KitaevSSU #graph
On the Representability of Line Graphs (SK, PS, CS, HÚ), pp. 478–479.
DLTDLT-2011-PlyushchenkoS
On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x2 = x3 (ANP, AMS), pp. 362–373.
DLTDLT-2011-RampersadV #word
On Highly Repetitive and Power Free Words (NR, EV), pp. 441–451.
ICALPICALP-v1-2011-AllenderW #algebra #branch #power of #source code
On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.
ICALPICALP-v1-2011-BockenhauerKKK #complexity #problem
On the Advice Complexity of the k-Server Problem (HJB, DK, RK, RK), pp. 207–218.
ICALPICALP-v1-2011-CanzarEKM
On Tree-Constrained Matchings and Generalizations (SC, KME, GWK, JM), pp. 98–109.
ICALPICALP-v1-2011-EpsteinILN
On Variants of File Caching (LE, CI, AL, JNG), pp. 195–206.
ICALPICALP-v1-2011-NordstromR #satisfiability #trade-off
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (JN, AAR), pp. 642–653.
ICALPICALP-v1-2011-Zhang #bound #communication #complexity #power of #quantum
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.
ICALPICALP-v2-2011-AlvimACP #data flow #difference #privacy
On the Relation between Differential Privacy and Quantitative Information Flow (MSA, MEA, KC, CP), pp. 60–76.
ICALPICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #reachability
On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
ICALPICALP-v2-2011-DengH #automaton #markov #semantics
On the Semantics of Markov Automata (YD, MH), pp. 307–318.
ICALPICALP-v2-2011-KieferMOWZ #algorithm
On Stabilization in Herman’s Algorithm (SK, ASM, JO, JW, LZ), pp. 466–477.
ICALPICALP-v2-2011-Zetzsche #automaton #monad #transducer
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
LATALATA-2011-Quaas #automaton #bound #problem
On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.
FMFM-2011-ZhangSPLD #reduction
On Combining State Space Reductions with Global Fairness Assumptions (SJZ, JS, JP, YL, JSD), pp. 432–447.
ICFPICFP-2011-DevrieseP
On the bright side of type classes: instance arguments in Agda (DD, FP), pp. 143–155.
FDGFDG-2011-AndersenLSSCP #game studies
On the harmfulness of secondary game objectives (EA, YEL, RS, RS, SC, ZP), pp. 30–37.
FDGFDG-2011-CrenshawOWH #game studies #multi #realtime #user interface
On creating a native real-time-strategy game user interface for multi-touch devices (NC, SO, WSW, AH), pp. 283–285.
CoGVS-Games-2011-VoulgariK #collaboration #game studies #interactive #learning #multi #online
On Studying Collaborative Learning Interactions in Massively Multiplayer Online Games (IV, VK), pp. 182–183.
CoGVS-Games-2011-VoutounosL
On the Presentation of Byzantine Art in Virtual Environments (CV, AL), pp. 176–177.
CHICHI-2011-FidasVA
On the necessity of user-friendly CAPTCHA (CF, AGV, NMA), pp. 2623–2626.
CHICHI-2011-HaradaTA #representation
On the audio representation of radial direction (SH, HT, CA), pp. 2779–2788.
CHICHI-2011-QuinnCRD #cost analysis #multi
On the costs of multiple trajectory pointing methods (PQ, AC, KJR, JD), pp. 859–862.
HCIIDGD-2011-RigbyD #analysis #design #network
On the Design of Organizational Network Analysis Software (JR, HD), pp. 550–555.
CAiSECAiSE-2011-LeopoldMR #automation #modelling #process
On the Automatic Labeling of Process Models (HL, JM, HAR), pp. 512–520.
ICEISICEIS-J-2011-NovaisCJM11a #approach #difference #evolution #interactive #using #visualisation
On the Use of Software Visualization to Analyze Software Evolution: An Interactive Differential Approach (RLN, GdFC, PRMSJ, MGM), pp. 241–255.
ICEISICEIS-v3-2011-LiXH
On Low-carbon Supply Chain Management (JL, FX, GH), pp. 497–501.
ICEISICEIS-v3-2011-NovaisCJM #approach #difference #evolution #interactive #using #visualisation
On the Use of Software Visualization to Analyze Software Evolution — An Interactive Differential Approach (RLN, GdFC, PRMSJ, MGdMN), pp. 15–24.
CIKMCIKM-2011-AmodeoAG #query
On relevance, time and query expansion (GA, GA, GG), pp. 1973–1976.
CIKMCIKM-2011-KonstantinouABTK #database #platform
On the elasticity of NoSQL databases over cloud management platforms (IK, EA, CB, DT, NK), pp. 2385–2388.
CIKMCIKM-2011-RiveroHRC #benchmark #metric #ontology #semantics
On benchmarking data translation systems for semantic-web ontologies (CRR, IH, DR, RC), pp. 1613–1618.
CIKMCIKM-2011-ShiYCYW #community #detection #multi
On selection of objective functions in multi-objective community detection (CS, PSY, YC, ZY, BW), pp. 2301–2304.
CIKMCIKM-2011-XingZZ #bias #feedback #problem
On bias problem in relevance feedback (QX, YZ, LZ), pp. 1965–1968.
ECIRECIR-2011-Robertson #evaluation #topic
On the Contributions of Topics to System Evaluation (SR), pp. 129–140.
ICMLICML-2011-HelmboldL
On the Necessity of Irrelevant Variables (DPH, PML), pp. 281–288.
ICMLICML-2011-KimS #kernel #robust
On the Robustness of Kernel Density M-Estimators (JK, CDS), pp. 697–704.
ICMLICML-2011-LeNCLPN #learning #optimisation
On optimization methods for deep learning (QVL, JN, AC, AL, BP, AYN), pp. 265–272.
ICMLICML-2011-LiZSC #integration #learning #modelling #taxonomy #topic
On the Integration of Topic Modeling and Dictionary Learning (LL, MZ, GS, LC), pp. 625–632.
ICMLICML-2011-NakajimaSB #automation
On Bayesian PCA: Automatic Dimensionality Selection and Analytic Solution (SN, MS, SDB), pp. 497–504.
ICMLICML-2011-NockMBN #adaptation
On tracking portfolios with certainty equivalents on a generalization of Markowitz model: the Fool, the Wise and the Adaptive (RN, BM, EB, FN), pp. 73–80.
ICMLICML-2011-SaxeKCBSN #learning #random
On Random Weights and Unsupervised Feature Learning (AMS, PWK, ZC, MB, BS, AYN), pp. 1089–1096.
ICMLICML-2011-SugiyamaYKH #clustering #parametricity
On Information-Maximization Clustering: Tuning Parameter Selection and Analytic Solution (MS, MY, MK, HH), pp. 65–72.
ICMLICML-2011-SwerskyRBMF #energy #modelling
On Autoencoders and Score Matching for Energy Based Models (KS, MR, DB, BMM, NdF), pp. 1201–1208.
ICMLICML-2011-YangR #learning #using #visual notation
On the Use of Variational Inference for Learning Discrete Graphical Model (EY, PDR), pp. 1009–1016.
KDDKDD-2011-AggarwalXY #data-driven
On dynamic data-driven selection of sensor streams (CCA, YX, PSY), pp. 1226–1234.
KDDKDD-2011-PedarsaniG #network #privacy
On the privacy of anonymized networks (PP, MG), pp. 1235–1243.
KDDKDD-2011-YeSLYJ #network #semantics #social
On the semantic annotation of places in location-based social networks (MY, DS, WCL, PY, KJ), pp. 520–528.
KEODKEOD-2011-Bab #integration #logic
On the Integration of Knowledge in a Propositional Logical Layer (SB), pp. 299–303.
KEODKEOD-2011-KontotasiouBB #framework #ontology #re-engineering
On Establishing an Ontology Reengineering Framework (DK, CB, PDB), pp. 354–360.
MLDMMLDM-2011-Hasan #behaviour
On the Temporal Behavior of EEG Recorded during Real Finger Movement (BASH), pp. 335–347.
SIGIRSIGIR-2011-SantosMO11a #metric #ranking
On the suitability of diversity metrics for learning-to-rank for diversity (RLTS, CM, IO), pp. 1185–1186.
SIGIRSIGIR-2011-ValletC #personalisation #web
On diversifying and personalizing web search (DV, PC), pp. 1157–1158.
SIGIRSIGIR-2011-YeXLX
On theme location discovery for travelogue services (MY, RX, WCL, XX), pp. 465–474.
BXBX-2011-Brandt #enterprise #graph grammar #modelling #requirements
On the role of Triple Graph Grammars Concerning Requirements for Enterprise Modeling (CB), p. 54.
PLEASEPLEASE-2011-MichalikWB #evolution #problem #product line
On the problems with evolving Egemin’s software product line (BM, DW, WVB), pp. 15–19.
OnwardOnward-2011-Adamczyk
On the language metaphor (PA), pp. 121–128.
AdaEuropeAdaEurope-2011-Hatton #evolution #natural language
On the Evolution of Unnatural Language (LH), pp. 219–225.
PADLPADL-2011-WielemakerC #prolog
On the Portability of Prolog Applications (JW, VSC), pp. 69–83.
PLDIPLDI-2011-BouajjaniDES #analysis #interprocedural #source code
On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.
POPLPOPL-2011-SinhaW #abstraction
On interference abstractions (NS, CW), pp. 423–434.
SASSAS-2011-BouajjaniEP #concurrent #source code
On Sequentializing Concurrent Programs (AB, ME, GP), pp. 129–145.
RERE-2011-DekhtyarDHHCK #analysis #performance #requirements #statistics
On human analyst performance in assisted requirements tracing: Statistical analysis (AD, OD, JH, JHH, DC, WKK), pp. 111–120.
RERE-2011-FranchMTC #framework #modelling #using
On the joint use of i* with other modelling frameworks: A vision paper (XF, AM, JT, CC), pp. 133–142.
ESEC-FSEESEC-FSE-2011-BeckD #composition #congruence
On the congruence of modularity and code coupling (FB, SD), pp. 354–364.
ESEC-FSEESEC-FSE-2011-CosmoV #co-evolution #component
On software component co-installability (RDC, JV), pp. 256–266.
SACSAC-2011-AlmeidaC #enterprise #ontology #towards
On the elements of an enterprise: towards an ontology-based account (JPAA, ECSC), pp. 323–330.
SACSAC-2011-BoscP #axiom #flexibility #fuzzy #retrieval
On three fuzzy connectives for flexible data retrieval and their axiomatization (PB, OP), pp. 1114–1118.
SACSAC-2011-DebroyW #equivalence #fault #locality
On the equivalence of certain fault localization techniques (VD, WEW), pp. 1457–1463.
SACSAC-2011-MunizL #encryption #protocol #recognition
On the (im)possibility of perennial message recognition protocols without public-key cryptography (MGM, PL), pp. 1510–1515.
GPCEGPCE-2011-RibeiroQBTBS #dependence #maintenance #product line
On the impact of feature dependencies when maintaining preprocessor-based software product lines (MR, FQ, PB, TT, CB, SS), pp. 23–32.
CASECASE-2011-KumarSTS #fuzzy #modelling
On the combination of fuzzy models (MK, NS, KT, RS), pp. 322–326.
DACDAC-2011-SchneiderGCBEP #quantifier
On the quantification of sustainability and extensibility of FlexRay schedules (RS, DG, SC, UDB, PE, ZP), pp. 375–380.
DATEDATE-2011-ButtrickK #3d #network #testing #using
On testing prebond dies with incomplete clock networks in a 3D IC using DLLs (MB, SK), pp. 1418–1423.
DATEDATE-2011-ChanSGK
On the efficacy of NBTI mitigation techniques (TBC, JS, PG, RK), pp. 932–937.
DATEDATE-2011-LiuX #debugging #multi
On multiplexed signal tracing for post-silicon debug (XL, QX), pp. 685–690.
DATEDATE-2011-SreedharK #design #identification #process
On design of test structures for lithographic process corner identification (AS, SK), pp. 800–805.
DATEDATE-2011-TsaiLCKCK #bound
On routing fixed escaped boundary pins for high speed boards (TYT, RJL, CYC, CYK, HMC, YK), pp. 461–466.
DATEDATE-2011-YeHL #fault #multi #using
On diagnosis of multiple faults using compacted responses (JY, YH, XL), pp. 679–684.
ISMMISMM-2011-GuD #collaboration
On the theory and potential of LRU-MRU collaborative cache management (XG, CD), pp. 43–54.
PDPPDP-2011-AldinucciCDDTT #biology #design #multi
On Designing Multicore-Aware Simulators for Biological Systems (MA, MC, FD, MD, MT, AT), pp. 318–325.
FASEFASE-2011-KhanH #analysis #contract #dependence #modelling #testing #using #visual notation
On Model-Based Regression Testing of Web-Services Using Dependency Analysis of Visual Contracts (TAK, RH), pp. 341–355.
FoSSaCSFoSSaCS-2011-DelzannoSZ #ad hoc #clique #network #power of #verification
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (GD, AS, GZ), pp. 441–455.
STOCSTOC-2011-Kopparty #complexity #finite
On the complexity of powering in finite fields (SK), pp. 489–498.
STOCSTOC-2011-PapadimitriouP
On optimal single-item auctions (CHP, GP), pp. 119–128.
TACASTACAS-2011-KieferW #parallel #probability #process #source code
On Probabilistic Parallel Programs with Process Creation and Synchronisation (SK, DW), pp. 296–310.
CADECADE-2011-KovacsMV #order
On Transfinite Knuth-Bendix Orders (LK, GM, AV), pp. 384–399.
CSLCSL-2011-Egri #constraints #problem
On Constraint Satisfaction Problems below P (LE), pp. 203–217.
ICLPICLP-J-2011-Antoy #correctness
On the correctness of pull-tabbing (SA), pp. 713–730.
ICLPICLP-J-2011-AreiasR #evaluation #logic programming #source code
On combining linear-based strategies for tabled evaluation of logic programs (MA, RR), pp. 681–696.
ICSTICST-2011-Nica #testing #using
On the Improvement of the Mutation Score Using Distinguishing Test Cases (SN), pp. 423–426.
ISSTAISSTA-2011-DiGiuseppeJ #fault #locality #multi
On the influence of multiple faults on coverage-based fault localization (ND, JAJ), pp. 210–220.
ICSTSAT-2011-AudemardLMS
On Freezing and Reactivating Learnt Clauses (GA, JML, BM, LS), pp. 188–200.
ICSTSAT-2011-KullmannZ #normalisation
On Variables with Few Occurrences in Conjunctive Normal Forms (OK, XZ), pp. 33–46.
ICSTSAT-2011-SilvaL #algorithm
On Improving MUS Extraction Algorithms (JPMS, IL), pp. 159–173.
ECSAECSA-2010-EsfahaniM #adaptation #architecture #middleware #platform
On the Role of Architectural Styles in Improving the Adaptation Support of Middleware Platforms (NE, SM), pp. 433–440.
ECSAECSA-2010-Lopez-HerrejonE #architecture #product line
On the Need of Safe Software Product Line Architectures (RELH, AE), pp. 493–496.
DocEngDocEng-2010-BalinskyBS #documentation
On helmholtz’s principle for documents processing (AAB, HB, SJS), pp. 283–286.
DRRDRR-2010-ChenL #pseudo #security #usability
On the usability and security of pseudo-signatures (JC, DPL), pp. 1–10.
HTHT-2010-BeelG #robust
On the robustness of google scholar against spam (JB, BG), pp. 297–298.
PODSPODS-2010-DeutchKM #fixpoint #markov #probability #query
On probabilistic fixpoint and Markov chain query languages (DD, CK, TM), pp. 215–226.
PODSPODS-2010-Wijsen #database #first-order #nondeterminism #query
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.
SIGMODSIGMOD-2010-AgrawalAK #set
On indexing error-tolerant set containment (PA, AA, RK), pp. 927–938.
SIGMODSIGMOD-2010-ArasuGK #learning
On active learning of record matching packages (AA, MG, RK), pp. 783–794.
VLDBVLDB-2010-AbhiramaBDSH #cost analysis
On the Stability of Plan Costs and the Costs of Plan Stability (MA, SB, AD, HS, JRH), pp. 1137–1148.
VLDBVLDB-2010-AggarwalLYJ #graph #mining
On Dense Pattern Mining in Graph Streams (CCA, YL, PSY, RJ), pp. 975–984.
VLDBVLDB-2010-ZhangHOPS #multi
On Multi-Column Foreign Key Discovery (MZ, MH, BCO, CMP, DS), pp. 805–814.
VLDBVLDB-2010-ZhaoH #graph #network #optimisation #query #scalability
On Graph Query Optimization in Large Networks (PZ, JH), pp. 340–351.
VLDBVLDB-2011-WangZTT10 #graph
On Triangulation-based Dense Neighborhood Graphs Discovery (NW, JZ, KLT, AKHT), pp. 58–68.
EDMEDM-2010-DesmaraisP #performance #student
On the Faithfulness of Simulated Student Performance Data (MCD, IP), pp. 21–30.
ICPCICPC-2010-OlivetoGPL #automation #equivalence #information retrieval #traceability
On the Equivalence of Information Retrieval Methods for Automated Traceability Link Recovery (RO, MG, DP, ADL), pp. 68–71.
ICPCICPC-2010-ShternT #algorithm #clustering
On the Comparability of Software Clustering Algorithms (MS, VT), pp. 64–67.
ICSMEICSM-2010-Haller #correctness #implementation #information management
On the implementation and correctness of information system upgrades (KH), pp. 1–5.
WCREWCRE-2010-HaiducAMM #automation #source code #summary #using
On the Use of Automated Text Summarization Techniques for Summarizing Source Code (SH, JA, LM, AM), pp. 35–44.
AFLAFL-J-2008-AfoninK10 #regular expression
On the Structure of Finitely Generated Semigroups of Unary Regular Languages (SA, EK), pp. 689–704.
AFLAFL-J-2008-KutribMO10 #automaton
On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.
DLTDLT-J-2008-Ada10 #communication #complexity #nondeterminism #regular expression
On the Non-Deterministic Communication Complexity of Regular Languages (AA), pp. 479–493.
DLTDLT-J-2008-HolubN10 #finite #word
On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 633–645.
CIAACIAA-2010-Egri-NagyN #finite #word
On Straight Words and Minimal Permutators in Finite Transformation Semigroups (AEN, CLN), pp. 115–124.
CIAACIAA-2010-EpifanioFGMS #graph #lazy evaluation
On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.
DLTDLT-2010-Berlinkov
On a Conjecture by Carpi and D’Alessandro (MVB), pp. 66–75.
DLTDLT-2010-BrodaMMR #automaton
On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.
DLTDLT-2010-CarpiD #hybrid #problem
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.
DLTDLT-2010-DassowM #context-free grammar #strict
On Restricted Context-Free Grammars (JD, TM), pp. 434–435.
DLTDLT-2010-EsikI #context-free grammar
On Müller Context-Free Grammars (ZÉ, SI), pp. 173–184.
DLTDLT-2010-HalavaHKR #word
On the Periodicity of Morphic Words (VH, TH, TK, MR), pp. 209–217.
DLTDLT-2010-Ibarra #problem
On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.
DLTDLT-2010-KlimaP
On Schützenberger Products of Semirings (OK, LP), pp. 279–290.
DLTDLT-2010-Kopecki
On the Iterated Hairpin Completion (SK), pp. 438–439.
DLTDLT-2010-LehtinenO #equation
On Language Equations XXK = XXL and XM = N over a Unary Alphabet (TL, AO), pp. 291–302.
DLTDLT-2010-OttoPM #automaton
On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.
DLTDLT-2010-PorrecaLZ
On a Powerful Class of Non-universal P Systems with Active Membranes (AEP, AL, CZ), pp. 364–375.
DLTDLT-2010-Schluter #automaton #lookahead
On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (NS), pp. 440–441.
DLTDLT-2010-Shur
On the Existence of Minimal β-Powers (AMS), pp. 411–422.
ICALPICALP-v1-2010-BhattacharyaDMT #approximate
On Approximate Horn Formula Minimization (AB, BD, DM, GT), pp. 438–450.
ICALPICALP-v1-2010-BorodinL #combinator #design
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions (AB, BL), pp. 90–101.
ICALPICALP-v1-2010-GuruswamiS
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.
ICALPICALP-v1-2010-HarksK #game studies #nash
On the Existence of Pure Nash Equilibria in Weighted Congestion Games (TH, MK), pp. 79–89.
ICALPICALP-v1-2010-JacobsCLM #complexity
On the Complexity of Searching in Trees: Average-Case Minimization (TJ, FC, ESL, MM), pp. 527–539.
ICALPICALP-v1-2010-Litow
On Sums of Roots of Unity (BEL), pp. 420–425.
ICALPICALP-v1-2010-PatrascuT #independence #linear
On the k-Independence Required by Linear Probing and Minwise Independence (MP, MT), pp. 715–726.
ICALPICALP-v1-2010-ShpilkaV #polynomial #testing
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors (AS, IV), pp. 408–419.
ICALPICALP-v2-2010-Blum #lr #polynomial
On LR(k)-Parsers of Polynomial Size (NB), pp. 163–174.
ICALPICALP-v2-2010-ChenF #logic #proving
On p-Optimal Proof Systems and Logics for PTIME (YC, JF), pp. 321–332.
ICALPICALP-v2-2010-HirschkoffP #replication #similarity
On Bisimilarity and Substitution in Presence of Replication (DH, DP), pp. 454–465.
ICALPICALP-v2-2010-LanesePSS #calculus #communication #higher-order #process
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 442–453.
ICALPICALP-v2-2010-Zetzsche #random
On Erasing Productions in Random Context Grammars (GZ), pp. 175–186.
LATALATA-2010-ChoffrutMMP #power of
On the Expressive Power of FO[+] (CC, AM, CM, BP), pp. 190–201.
LATALATA-2010-CrochemoreIKRRW #polynomial #string
On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.
LATALATA-2010-Cruz-SantosM #quantum #reduction #satisfiability
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.
IFMIFM-2010-Baier #distributed #model checking #random
On Model Checking Techniques for Randomized Distributed Systems (CB), pp. 1–11.
RTARTA-2010-GmeinerGS
On (Un)Soundness of Unravelings (KG, BG, FS), pp. 119–134.
AIIDEAIIDE-2010-FurtakB #complexity #game studies #graph
On the Complexity of Two-Player Attrition Games Played on Graphs (TF, MB).
CoGCIG-2010-TeytaudT #algorithm #monte carlo
On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms (FT, OT), pp. 359–364.
CoGVS-Games-2010-SantosDRP #modelling
On the Expeditious Modelling of Buildings (DS, MD, NR, AP), pp. 60–67.
GT-VMTGT-VMT-2010-MolR #graph #order
On A Graph Formalism for Ordered Edges (MdM, AR).
ICGTICGT-2010-BaldanBCKS #graph grammar
On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars (PB, AB, AC, BK, SS), pp. 91–106.
CHICHI-2010-Salvucci #re-engineering
On reconstruction of task context after interruption (DDS), pp. 89–92.
CSCWCSCW-2010-HechtG #locality
On the “localness” of user-generated content (BH, DG), pp. 229–232.
CAiSECAiSE-2010-LagunaMC #case study #modelling #question #semantics
On the Semantics of the Extend Relationship in Use Case Models: Open-Closed Principle or Clairvoyance? (MAL, JMM, YC), pp. 409–423.
ICEISICEIS-HCI-2010-BellstromT #education #programming #visualisation
On the Importance of Visualizing in Programming Education (PB, CT), pp. 131–136.
ICEISICEIS-ISAS-2010-ShishkovWS #energy
On the Application of Autonomic and Context-aware Computing to Support Home Energy Management (BS, MW, MvS), pp. 307–313.
CIKMCIKM-2010-CarmelRY
On the relationship between novelty and popularity of user-generated content (DC, HR, EYT), pp. 1509–1512.
CIKMCIKM-2010-DoulkeridisVNKV #multi
On the selectivity of multidimensional routing indices (CD, AV, KN, YK, MV), pp. 109–118.
CIKMCIKM-2010-GolbandiKL #recommendation
On bootstrapping recommender systems (NG, YK, RL), pp. 1805–1808.
CIKMCIKM-2010-RaiberK #documentation #identification
On identifying representative relevant documents (FR, OK), pp. 99–108.
CIKMCIKM-2010-YinLL #social #web
On top-k social web search (PY, WCL, KCKL), pp. 1313–1316.
CIKMCIKM-2010-ZhaoAY #composition #nondeterminism #set
On wavelet decomposition of uncertain time series data sets (YZ, CCA, PSY), pp. 129–138.
ECIRECIR-2010-RamanUBB #documentation #feedback #pseudo #using
On Improving Pseudo-Relevance Feedback Using Pseudo-Irrelevant Documents (KR, RU, PB, AB), pp. 573–576.
ECIRECIR-2010-SooF
On Foreign Name Search (JJS, OF), pp. 483–494.
ICMLICML-2010-DuchiMJ #algorithm #consistency #ranking
On the Consistency of Ranking Algorithms (JCD, LWM, MIJ), pp. 327–334.
ICMLICML-2010-HueV #kernel #learning
On learning with kernels for unordered pairs (MH, JPV), pp. 463–470.
ICMLICML-2010-KolarPX #parametricity
On Sparse Nonparametric Conditional Covariance Selection (MK, APP, EPX), pp. 559–566.
ICMLICML-2010-LiangS #interactive #learning #multi
On the Interaction between Norm and Dimensionality: Multiple Regimes in Learning (PL, NS), pp. 647–654.
ICPRICPR-2010-AhmadNSNN #distributed #estimation #network
On Clock Offset Estimation in Wireless Sensor Networks with Weibull Distributed Network Delays (AA, AN, ES, HNN, MNN), pp. 2322–2325.
ICPRICPR-2010-BaradaraniMW #design #image
On the Design of a Class of Odd-Length Biorthogonal Wavelet Filter Banks for Signal and Image Processing (AB, PM, QMJW), pp. 2282–2285.
ICPRICPR-2010-BharathM #empirical #online #recognition #word
On the Significance of Stroke Size and Position for Online Handwritten Devanagari Word Recognition: An Empirical Study (AB, SM), pp. 2033–2036.
ICPRICPR-2010-CapitaineF10a #clustering #image #segmentation
On Selecting an Optimal Number of Clusters for Color Image Segmentation (HLC, CF), pp. 3388–3391.
ICPRICPR-2010-ChenWL #clustering
On Dynamic Weighting of Data in Clustering with K-Alpha Means (SC, HW, BL), pp. 774–777.
ICPRICPR-2010-Gonzalez-RubioC #multi #string #using
On the Use of Median String for Multi-source Translation (JGR, FC), pp. 4328–4331.
ICPRICPR-2010-KoniuszM #image #segmentation
On a Quest for Image Descriptors Based on Unsupervised Segmentation Maps (PK, KM), pp. 762–765.
ICPRICPR-2010-LiBN #network #performance
On the Performance of Handoff and Tracking in a Camera Network (YL, BB, VN), pp. 3645–3648.
ICPRICPR-2010-LourencoFJ #clustering #scalability
On the Scalability of Evidence Accumulation Clustering (AL, ALNF, AKJ), pp. 782–785.
ICPRICPR-2010-MelendezPG #adaptation #classification #segmentation
On Adapting Pixel-based Classification to Unsupervised Texture Segmentation (JM, DP, MAG), pp. 854–857.
ICPRICPR-2010-WoodardPMJR
On the Fusion of Periocular and Iris Biometrics in Non-ideal Imagery (DLW, SJP, PEM, RRJ, AR), pp. 201–204.
ICPRICPR-2010-ZhangYFZ #recognition #reduction #representation
On the Dimensionality Reduction for Sparse Representation Based Face Recognition (LZ, MY, ZF, DZ), pp. 1237–1240.
KDDKDD-2010-GaoLFWSH #community #detection #network #performance
On community outliers and their efficient detection in information networks (JG, FL, WF, CW, YS, JH), pp. 813–822.
KDDKDD-2010-WenL #quality #social
On the quality of inferring interests from social neighbors (ZW, CYL), pp. 373–382.
KEODKEOD-2010-AbouenourBR
On the Extension of Arabic Wordnet Named Entities and Its Impact on Question / Answering (LA, KB, PR), pp. 424–429.
KEODKEOD-2010-EynardMM #analysis #ontology #using
On the Use of Correspondence Analysis to Learn Seed Ontologies from Text (DE, FM, MM), pp. 430–437.
KRKR-2010-Arieli #logic
On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Information (OA).
KRKR-2010-CiabattoniR #fuzzy #monad
On the Classical Content of Monadic G with Involutive Negation and its Application to a Fuzzy Medical Expert System (AC, PR).
KRKR-2010-PenalozaS #axiom #complexity #logic #product line
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics (RP, BS).
KRKR-2010-ZhangZ #bound #semantics #set #source code
On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
RecSysRecSys-2010-AdomaviciusZ #algorithm #recommendation
On the stability of recommendation algorithms (GA, JZ), pp. 47–54.
RecSysRecSys-2010-EsparzaOS #realtime #recommendation #web
On the real-time web as a source of recommendation knowledge (SGE, MPO, BS), pp. 305–308.
SIGIRSIGIR-2010-AmatiACGG #performance #retrieval #topic
On performance of topical opinion retrieval (GA, GA, VC, CG, GG), pp. 777–778.
SIGIRSIGIR-2010-AzzopardiB #effectiveness
On the relationship between effectiveness and accessibility (LA, RB), pp. 889–890.
SIGIRSIGIR-2010-Barron-Cedeno #detection #reuse
On the mono- and cross-language detection of text reuse and plagiarism (ABC), p. 914.
SIGIRSIGIR-2010-RadovanovicNI #modelling
On the existence of obstinate results in vector space models (MR, AN, MI), pp. 186–193.
SIGIRSIGIR-2010-WangZ #analysis #effectiveness #information retrieval #metric #optimisation #statistics
On statistical analysis and optimization of information retrieval effectiveness metrics (JW, JZ), pp. 226–233.
ECMFAECMFA-2010-Vallecillo #modelling
On the Combination of Domain Specific Modeling Languages (AV), pp. 305–320.
LOPSTRLOPSTR-2010-Seki #induction #proving
On Inductive Proofs by Extended Unfold/Fold Transformation Rules (HS), pp. 117–132.
PADLPADL-2010-Costa #implementation
On the Implementation of the CLP(BN) Language (VSC), pp. 234–248.
POPLPOPL-2010-AtigBBM #memory management #modelling #problem #verification
On the verification problem for weak memory models (MFA, AB, SB, MM), pp. 7–18.
PPDPPPDP-2010-Bonacina #proving #theorem proving
On theorem proving for program checking: historical perspective and recent developments (MPB), pp. 1–12.
RERE-2010-GacituaSG #abstraction #effectiveness #identification #requirements
On the Effectiveness of Abstraction Identification in Requirements Engineering (RG, PS, VG), pp. 5–14.
REFSQREFSQ-2010-ErnstM #lifecycle #quality #requirements
On the Perception of Software Quality Requirements during the Project Lifecycle (NAE, JM), pp. 143–157.
REFSQREFSQ-2010-GervasiZ #ambiguity
On the Role of Ambiguity in RE (VG, DZ), pp. 248–254.
SACSAC-2010-JungCCL #query
On processing location based top-k queries in the wireless broadcasting system (HJ, BKC, YDC, LL), pp. 585–591.
SACSAC-2010-Perez-CastilloGP #process #using
On the use of patterns to recover business processes (RPC, IGRdG, MP), pp. 165–166.
LDTALDTA-2010-HoldermansH #program transformation #type system
On the rôle of minimal typing derivations in type-driven program transformation (SH, JH), p. 2.
LDTALDTA-2010-KlintSV #domain-specific language #implementation #maintenance #tool support
On the impact of DSL tools on the maintainability of language implementations (PK, TvdS, JJV), p. 10.
CASECASE-2010-ChanR #clustering #estimation #multi #scheduling #tool support
On gradient estimation of scheduling for multi-cluster tools with general robot moving times (WK(C, TMR), pp. 112–117.
CGOCGO-2010-WangWY #layout #memory management
On improving heap memory layout by dynamic pool allocation (ZW, CW, PCY), pp. 92–100.
DACDAC-2010-NadakuditiM #cost analysis
On the costs and benefits of stochasticity in stream processing (RRN, ILM), pp. 320–325.
DATEDATE-2010-ChandraPA
On the efficacy of write-assist techniques in low voltage nanoscale SRAMs (VC, CP, RCA), pp. 345–350.
DATEDATE-2010-ChineaGDDK #megamodelling #performance
On the construction of guaranteed passive macromodels for high-speed channels (AC, SGT, DD, TD, LK), pp. 1142–1147.
DATEDATE-2010-PomeranzR10a #functional #testing
On reset based functional broadside tests (IP, SMR), pp. 1438–1443.
DATEDATE-2010-UgryumovaS #algorithm #modelling
On passivity of the super node algorithm for EM modeling of interconnect systems (MVU, WHAS), pp. 471–476.
DATEDATE-2010-WeerasekeraGPT #3d
On signalling over Through-Silicon Via (TSV) interconnects in 3-D Integrated Circuits (RW, MG, DP, HT), pp. 1325–1328.
PDPPDP-2010-SerafinoR #algorithm #parallel #search-based
On the Application of Multiple-Deme Parallel Genetic Algorithms in Astrophysics (DdS, FR), pp. 231–237.
PDPPDP-2010-Strey #implementation #performance #reduction
On the Efficient Implementation of Reductions on the Cell Broadband Engine (AS), pp. 223–228.
PDPPDP-2010-UcarC #clustering #matrix #modelling #scalability
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning (BU, ÜVÇ), pp. 593–600.
ESOPESOP-2010-LaneseVF #power of
On the Expressive Power of Primitives for Compensation Handling (IL, CV, CF), pp. 366–386.
FoSSaCSFoSSaCS-2010-AcciaiBZ #behaviour #logic #simulation
On the Relationship between Spatial Logics and Behavioral Simulations (LA, MB, GZ), pp. 146–160.
STOCSTOC-2010-ArvindS #commutative
On the hardness of the noncommutative determinant (VA, SS), pp. 677–686.
STOCSTOC-2010-DyerR #complexity #csp
On the complexity of #CSP (MED, DR), pp. 725–734.
STOCSTOC-2010-FraigniaudG #network
On the searchability of small-world networks with arbitrary underlying structure (PF, GG), pp. 389–398.
STOCSTOC-2010-GoyalJ #complexity
On the round complexity of covert computation (VG, AJ), pp. 191–200.
STOCSTOC-2010-GuruswamiHK #linear #random
On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.
STOCSTOC-2010-HaramatyS #polynomial
On the structure of cubic and quartic polynomials (EH, AS), pp. 331–340.
STOCSTOC-2010-HardtT #difference #geometry #privacy
On the geometry of differential privacy (MH, KT), pp. 705–714.
STOCSTOC-2010-PaturiP #complexity #satisfiability
On the complexity of circuit satisfiability (RP, PP), pp. 241–250.
TACASTACAS-2010-BauerMSH #refinement
On Weak Modal Compatibility, Refinement, and the MIO Workbench (SSB, PM, AS, RH), pp. 175–189.
WRLAWRLA-2010-RiveraDV #behaviour #domain-specific language #realtime #semantics #visual notation
On the Behavioral Semantics of Real-Time Domain Specific Visual Languages (JER, FD, AV), pp. 174–190.
CAVCAV-2010-ZhouHWG #array #bound
On Array Theory of Bounded Elements (MZ, FH, BYW, MG), pp. 570–584.
CSLCSL-2010-ChenF #problem #proving #slicing
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.
CSLCSL-2010-NenovP #logic
On the Computability of Region-Based Euclidean Logics (YN, IPH), pp. 439–453.
IJCARIJCAR-2010-IhlemannS #reasoning
On Hierarchical Reasoning in Combinations of Theories (CI, VSS), pp. 30–45.
IJCARIJCAR-2010-SudaWW
On the Saturation of YAGO (MS, CW, PW), pp. 441–456.
ISSTAISSTA-2010-DanielGM #execution #symbolic computation #using
On test repair using symbolic execution (BD, TG, DM), pp. 207–218.
LICSLICS-2010-AvronAZ #logic
On Strong Maximality of Paraconsistent Finite-Valued Logics (AA, OA, AZ), pp. 304–313.
LICSLICS-2010-BodirskyHM #algebra #approach #constraints
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction (MB, MH, BM), pp. 90–99.
LICSLICS-2010-EisentrautHZ #automaton #probability
On Probabilistic Automata in Continuous Time (CE, HH, LZ), pp. 342–351.
LICSLICS-2010-He #finite #first-order #quantifier #strict
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.
LICSLICS-2010-StatonW #symmetry
On the Expressivity of Symmetry in Event Structures (SS, GW), pp. 392–401.
ICSTSAT-2010-DantsinW #exponential #satisfiability
On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.
ICSTSAT-2010-PankratovB #problem #satisfiability
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.
CBSECBSE-2009-BirkmeierO #classification #comparison #component #identification #state of the art
On Component Identification Approaches — Classification, State of the Art, and Comparison (DB, SO), pp. 1–18.
QoSAQoSA-2009-AnselmiCA #constraints #performance
On the Consolidation of Data-Centers with Performance Constraints (JA, PC, EA), pp. 163–176.
WICSA-ECSAWICSA-ECSA-2009-GuL #architecture
On service-oriented architectural concerns and viewpoints (QG, PL), pp. 289–292.
WICSA-ECSAWICSA-ECSA-2009-PintoFVPDM #aspect-oriented #design pattern #evolution
On the need of architectural patterns in AOSD for software evolution (MP, LF, JAV, PFP, FCD, ÉM), pp. 245–248.
DocEngDocEng-2009-BarcenasGL #analysis #constraints #query
On the analysis of queries with counting constraints (EB, PG, NL), pp. 21–24.
DocEngDocEng-2009-GotscharekRRS #documentation
On lexical resources for digitization of historical documents (AG, UR, CR, KUS), pp. 193–200.
HTHT-2009-Bernstein #hypermedia
On hypertext narrative (MB), pp. 5–14.
ICDARICDAR-2009-FornesLSB #identification #music #using
On the Use of Textural Features for Writer Identification in Old Handwritten Music Scores (AF, JL, GS, HB), pp. 996–1000.
VLDBVLDB-2009-MeierSL #termination
On Chase Termination Beyond Stratification (MM, MS, GL), pp. 970–981.
ICPCICPC-2009-CapobiancoLOPP #traceability
On the role of the nouns in IR-based traceability recovery (GC, ADL, RO, AP, SP), pp. 148–157.
ICSMEICSM-2009-AnbalaganV #debugging #open source #predict
On predicting the time taken to correct bug reports in open source projects (PA, MAV), pp. 523–526.
ICSMEICSM-2009-GayHMM #concept #feedback #using
On the use of relevance feedback in IR-based concept location (GG, SH, AM, TM), pp. 351–360.
MSRMSR-2009-AnbalaganV #mining #repository
On mining data across software repositories (PA, MAV), pp. 171–174.
MSRMSR-2009-Laar #industrial
On the transfer of evolutionary couplings to industry (PvdL), pp. 187–190.
MSRMSR-2009-RastkarM #interactive #question #recommendation #what
On what basis to recommend: Changesets or interactions? (SR, GCM), pp. 155–158.
MSRMSR-2009-ShihabJH #chat #developer #gnome #internet #using
On the use of Internet Relay Chat (IRC) meetings by developers of the GNOME GTK+ project (ES, ZMJ, AEH), pp. 107–110.
WCREWCRE-1999-DAmbrosLR99a #fault
On the Relationship Between Change Coupling and Software Defects (MD, ML, RR), pp. 135–144.
WCREWCRE-1999-Perez-CastilloGAP99a #legacy #source code #using
On the Use of ADM to Contextualize Data on Legacy Source Code for Software Modernization (RPC, IGRdG, OAG, MP), pp. 128–132.
CIAACIAA-2009-CastiglioneRS #algorithm
On Extremal Cases of Hopcroft’s Algorithm (GC, AR, MS), pp. 14–23.
CIAACIAA-2009-HolubS #automaton #finite #implementation #parallel
On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.
DLTDLT-2009-BlakeleyBGR #complexity #set #word
On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLTDLT-2009-FriscoI #automaton #finite #multi
On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.
DLTDLT-2009-FrougnyL
On Negative Bases (CF, ACL), pp. 252–263.
DLTDLT-2009-LehtinenO #equation #set
On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.
DLTDLT-2009-Saarela #complexity #equation #satisfiability #theorem
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (AS), pp. 443–453.
DLTDLT-2009-Souza #decidability #equivalence #transducer
On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.
ICALPICALP-v1-2009-DemaineLW #query
On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
ICALPICALP-v1-2009-KhullerS
On Finding Dense Subgraphs (SK, BS), pp. 597–608.
ICALPICALP-v2-2009-DaskalakisP #network #theorem
On a Network Generalization of the Minmax Theorem (CD, CHP), pp. 423–434.
ICALPICALP-v2-2009-DaxKL #logic
On Regular Temporal Logics with Past, (CD, FK, ML), pp. 175–187.
ICALPICALP-v2-2009-LagoM #term rewriting #λ-calculus
On Constructor Rewrite Systems and the λ-Calculus (UDL, SM), pp. 163–174.
ICALPICALP-v2-2009-PuglieseTY
On Observing Dynamic Prioritised Actions in SOC (RP, FT, NY), pp. 558–570.
LATALATA-2009-BucciL #image #product line #word
On a Family of Morphic Images of Arnoux-Rauzy Words (MB, ADL), pp. 259–266.
LATALATA-2009-CarleN #regular expression
On Extended Regular Expressions (BC, PN), pp. 279–289.
LATALATA-2009-MitranaT #network
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes (VM, BT), pp. 588–600.
LATALATA-2009-Nicaud #automaton
On the Average Size of Glushkov’s Automata (CN), pp. 626–637.
LATALATA-2009-PardubskaPO #automaton #communication #correctness #parallel
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
FMFM-2009-BonakdarpourK #bound #complexity
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery (BB, SSK), pp. 660–675.
FMFM-2009-DaylightS #case study #design
On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study (EGD, SKS), pp. 273–288.
TLCATLCA-2009-BasaldellaT #logic
On the Meaning of Logical Completeness (MB, KT), pp. 50–64.
TLCATLCA-2009-Riba
On the Values of Reducibility Candidates (CR), pp. 264–278.
CoGCIG-2009-Boumaza #evolution
On the evolution of artificial Tetris players (AMB), pp. 387–393.
CoGCIG-2009-LopezO #locality #permutation #problem
On the effects of locality in a permutation problem: The Sudoku Puzzle (EGL, MO0), pp. 80–87.
DiGRADiGRA-2009-WaernD
On the Edge of Reality: Reality Fiction in 'Sanningen om Marika' (AW, MD).
CHICHI-2009-IsbisterH #challenge #design #evaluation #human-computer
On being supple: in search of rigor without rigidity in meeting new design and evaluation challenges for HCI practitioners (KI, KH), pp. 2233–2242.
CHICHI-2009-TalbotC #distance #representation
On the audio representation of distance for blind users (MT, WC), pp. 1839–1848.
HCIDHM-2009-WuLYSD
On Improving Provider Decision Making with Enhanced Computerized Clinical Reminders (SjW, MRL, YY, JJS, BND), pp. 569–577.
HCIHCI-NT-2009-SuzukiMSANYF #estimation #performance #using
On the Possibility about Performance Estimation Just before Beginning a Voluntary Motion Using Movement Related Cortical Potential (SS, TM, YS, KA, NN, TY, SF), pp. 184–191.
ICEISICEIS-HCI-2009-GarciaMDDSCBS #case study #collaboration #community #evaluation #web
On Collaborative Software for Web Communities Evaluation — A Case Study (LSG, DFM, JD, AID, MSS, MAC, LCEDB, FS), pp. 61–65.
ICEISICEIS-SAIC-2009-PetersA #analysis #platform #trust
On the Helpfulness of Product Reviews — An Analysis of Customer-to-Customer Trust on eShop-Platforms (GP, VA), pp. 41–46.
CIKMCIKM-2009-Baeza-YatesGJPT #multi #web
On the feasibility of multi-site web search engines (RABY, AG, FJ, VP, LT), pp. 425–434.
CIKMCIKM-2009-ChenBRT #adaptation #effectiveness #similarity
On domain similarity and effectiveness of adapting-to-rank (KC, JB, SR, BLT), pp. 1601–1604.
ECIRECIR-2009-Barron-CedenoR #automation #comparison #detection #n-gram
On Automatic Plagiarism Detection Based on n-Grams Comparison (ABC, PR), pp. 696–700.
ICMLICML-2009-KumarMT #approximate #composition
On sampling-based approximate spectral decomposition (SK, MM, AT), pp. 553–560.
ICMLICML-2009-ZhuX #markov #network
On primal and dual sparsity of Markov networks (JZ, EPX), pp. 1265–1272.
KDDKDD-2009-ChierichettiKLMPR #network #social
On compressing social networks (FC, RK, SL, MM, AP, PR), pp. 219–228.
KDDKDD-2009-LappasAPKG #documentation #sequence
On burstiness-aware search for document sequences (TL, BA, MP, DK, DG), pp. 477–486.
KDDKDD-2009-LiL #privacy #trade-off
On the tradeoff between privacy and utility in data publishing (TL, NL), pp. 517–526.
KEODKEOD-2009-TatsiopoulosBS #ontology
On Aligning Interesting Parts of Ontologies (CT, BB, KS), pp. 363–367.
MLDMMLDM-2009-Calliess
On Fixed Convex Combinations of No-Regret Learners (JPC), pp. 494–504.
RecSysRecSys-2009-SeyerlehnerFW #recommendation
On the limitations of browsing top-N recommender systems (KS, AF, GW), pp. 321–324.
SIGIRSIGIR-2009-Carterette #correlation #distance #rank #ranking
On rank correlation and the distance between rankings (BC), pp. 436–443.
SIGIRSIGIR-2009-CormackC #email
On the relative age of spam and ham training samples for email filtering (GVC, JMMdC), pp. 744–745.
SIGIRSIGIR-2009-DonmezSB
On the local optimality of λRank (PD, KMS, CJCB), pp. 460–467.
SIGIRSIGIR-2009-KonstasSJ #collaboration #network #recommendation #social
On social networks and collaborative recommendation (IK, VS, JMJ), pp. 195–202.
SIGIRSIGIR-2009-MacdonaldO #documentation #ranking
On perfect document rankings for expert search (CM, IO), pp. 740–741.
SIGIRSIGIR-2009-McCreadieMO #pipes and filters
On single-pass indexing with MapReduce (RM, CM, IO), pp. 742–743.
SIGIRSIGIR-2009-TatikondaJCP #manycore #performance
On efficient posting list intersection with multicore processors (ST, FJ, BBC, VP), pp. 738–739.
ECMFAECMDA-FA-2009-SadovykhVGHGE
On Study Results: Round Trip Engineering of Space Systems (AS, LV, EG, AH, JG, OE), pp. 265–276.
ECMFAECMDA-FA-2009-TisiJFCB #higher-order #model transformation #using
On the Use of Higher-Order Model Transformations (MT, FJ, PF, SC, JB), pp. 18–33.
SPLCSPLC-2009-KastnerARRBS #analysis #case study #problem
On the impact of the optional feature problem: analysis and case studies (CK, SA, SSuR, MR, DSB, GS), pp. 181–190.
OOPSLAOOPSLA-2009-Cook #abstraction #comprehension #revisited
On understanding data abstraction, revisited (WRC), pp. 557–572.
TOOLSTOOLS-EUROPE-2009-WimmerSBKK #framework #self
On Realizing a Framework for Self-tuning Mappings (MW, MS, PB, HK, GK), pp. 1–16.
AdaEuropeAdaEurope-2009-LauY #logic #testing
On Comparing Testing Criteria for Logical Decisions (MFL, YTY), pp. 44–58.
LOPSTRLOPSTR-2009-Seki #induction #proving
On Inductive and Coinductive Proofs via Unfold/Fold Transformations (HS), pp. 82–96.
PADLPADL-2009-PereiraDL #abduction #modelling
On Preferring and Inspecting Abductive Models (LMP, PD, GL), pp. 1–15.
PPDPPPDP-2009-GabbrielliMM #power of
On the expressive power of priorities in CHR (MG, JM, MCM), pp. 267–276.
QAPLQAPL-2009-GiroD #distributed #power of #probability
On the Expressive Power of Schedulers in Distributed Probabilistic Systems (SG, PRD), pp. 45–71.
AdaSIGAda-2009-Barkstrom #ada #algorithm #concurrent #multi #problem #using
On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms (BRB), pp. 61–72.
RERE-2009-CarvalloF #component #process #requirements #using
On the Use of Requirements for Driving Call-for-Tender Processes for Procuring Coarse-grained OTS Components (JPC, XF), pp. 287–292.
ESEC-FSEESEC-FSE-2009-CataldoN #analysis #empirical #maturity #process #quality
On the relationship between process maturity and geographic distribution: an empirical analysis of their impact on software quality (MC, SN), pp. 101–110.
SACSAC-2009-GiroD #automaton #probability #verification
On the verification of probabilistic I/O automata with unspecified rates (SG, PRD), pp. 582–586.
SACSAC-2009-KahvedzicK #data type #persistent
On the persistence of deleted windows registry data structures (DK, MTK), pp. 895–896.
SACSAC-2009-KerschbaumDSB #communication #complexity #multi #protocol
On the practical importance of communication complexity for secure multi-party computation protocols (FK, DD, AS, DB), pp. 2008–2015.
SACSAC-2009-LaiRC #embedded #realtime #scheduling
On scheduling soft real-time tasks with lock-free synchronization for embedded devices (SL, BR, HC), pp. 1685–1686.
SACSAC-2009-LavorLMM #distance #geometry #problem #subclass
On a discretizable subclass of instances of the molecular distance geometry problem (CL, LL, AM, NM), pp. 804–805.
SACSAC-2009-Stanclova #complexity
On the complexity of hierarchical associative memories (JS), pp. 908–913.
DACDAC-2009-YuanX #identification #pseudo #testing
On systematic illegal state identification for pseudo-functional testing (FY, QX), pp. 702–707.
DATEDATE-2009-BernasconiCTV
On decomposing Boolean functions via extended cofactoring (AB, VC, GT, TV), pp. 1464–1469.
DATEDATE-2009-FahmyRJ #bound #distributed #memory management #multi #realtime #transaction
On bounding response times under software transactional memory in distributed multiprocessor real-time systems (SFF, BR, EDJ), pp. 688–693.
DATEDATE-2009-LiCSSS #analysis #statistics
On hierarchical statistical static timing analysis (BL, NC, MS, WS, US), pp. 1320–1325.
DATEDATE-2009-Schat #fault
On the relationship between stuck-at fault coverage and transition fault coverage (JS), pp. 1218–1221.
DATEDATE-2009-SreedharK #analysis
On linewidth-based yield analysis for nanometer lithography (AS, SK), pp. 381–386.
DATEDATE-2009-VillenaCIS #modelling #parametricity #performance #reduction
On the efficient reduction of complete EM based parametric models (JFV, GC, DI, LMS), pp. 1172–1177.
PDPPDP-2009-AchourNS #adaptation #algorithm #clustering #modelling #performance #using
On the Use of Performance Models for Adaptive Algorithm Selection on Heterogeneous Clusters (SA, WN, LAS), pp. 85–89.
FASEFASE-2009-Kosiuczenko #implementation
On the Implementation of @pre (PK), pp. 246–261.
FoSSaCSFoSSaCS-2009-AlurDMW
On ω-Languages Defined by Mean-Payoff Conditions (RA, AD, OM, GW), pp. 333–347.
FoSSaCSFoSSaCS-2009-ArandaVV #power of #replication #strict
On the Expressive Power of Restriction and Priorities in CCS with Replication (JA, FDV, CV), pp. 242–256.
FoSSaCSFoSSaCS-2009-BroadbentO #higher-order #model checking #recursion
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
FoSSaCSFoSSaCS-2009-Leivant #logic
On the Completeness of Dynamic Logic (DL), pp. 78–91.
FoSSaCSFoSSaCS-2009-Smith #data flow
On the Foundations of Quantitative Information Flow (GS), pp. 288–302.
STOCSTOC-2009-DaskalakisP #equilibrium #nash
On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.
STOCSTOC-2009-DodisKL #encryption
On cryptography with auxiliary input (YD, YTK, SL), pp. 621–630.
STOCSTOC-2009-DworkNRRV #algorithm #complexity #performance
On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
STOCSTOC-2009-Even-DarMN #convergence #game studies
On the convergence of regret minimization dynamics in concave games (EED, YM, UN), pp. 523–532.
STOCSTOC-2009-GoldreichR #proximity #testing
On proximity oblivious testing (OG, DR), pp. 141–150.
STOCSTOC-2009-KushilevitzW #communication #complexity
On the complexity of communication complexity (EK, EW), pp. 465–474.
STOCSTOC-2009-LeeS #geometry #graph
On the geometry of graphs with a forbidden minor (JRL, AS), pp. 245–254.
CADECADE-2009-BonacinaLM #proving #satisfiability #theorem proving
On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving (MPB, CL, LMdM), pp. 35–50.
CAVCAV-2009-FuhrmannH #bound #induction #proving
On Extending Bounded Proofs to Inductive Proofs (OF, SH), pp. 278–290.
CAVCAV-2009-Monniaux #float #linear #using
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure (DM), pp. 570–583.
CSLCSL-2009-BlanquiR #semantics #termination
On the Relation between Sized-Types Based Termination and Semantic Labelling (FB, CR), pp. 147–162.
CSLCSL-2009-CockettS #communication #problem #word
On the Word Problem for ΣΠ-Categories, and the Properties of Two-Way Communication (JRBC, LS), pp. 194–208.
CSLCSL-2009-GuoWXC #model checking
On Model Checking Boolean BI (HG, HW, ZX, YC), pp. 302–316.
CSLCSL-2009-Kreutzer #higher-order #logic #monad
On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
CSLCSL-2009-Weber #complexity #logic
On the Complexity of Branching-Time Logics (VW), pp. 530–545.
ICLPICLP-2009-GebserKKS #constraints #implementation
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers (MG, RK, BK, TS), pp. 250–264.
ICSTICST-2009-LeitnerPMMO #effectiveness
On the Effectiveness of Test Extraction without Overhead (AL, AP, SM, BM, MO), pp. 416–425.
LICSLICS-2009-GollerMT #complexity #process #verification
On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
LICSLICS-2009-KieronskiT #equivalence #finite #first-order #logic #satisfiability
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
MBTMBT-2009-DadeauLH #automaton #generative #random #testing #using
On the Use of Uniform Random Generation of Automata for Testing (FD, JL, PCH), pp. 37–51.
ICSTSAT-2009-PorschenSS #aspect-oriented
On Some Aspects of Mixed Horn Formulas (SP, TS, ES), pp. 86–100.
ECSAECSA-2008-BatistaGCCG #aspect-oriented #configuration management
On the Interplay of Aspects and Dynamic Reconfiguration in a Specification-to-Deployment Environment (TVB, ATAG, GC, CC, AG), pp. 314–317.
ECSAECSA-2008-CapillaB #architecture #design #product line
On the Role of Architectural Design Decisions in Software Product Line Engineering (RC, MAB), pp. 241–255.
WICSAWICSA-2008-MolesiniGCB #analysis #architecture
On the Quantitative Analysis of Architecture Stability in Aspectual Decompositions (AM, AFG, CvFGC, TVB), pp. 29–38.
JCDLJCDL-2008-Bani-AhmadO #library
On content-driven search-keyword suggesters for literature digital libraries (SBA, GÖ), pp. 21–24.
PODSPODS-2008-FerraginaGGSV #string
On searching compressed string collections cache-obliviously (PF, RG, AG, RS, JSV), pp. 181–190.
PODSPODS-2008-SenellartG #complexity #database
On the complexity of deriving schema mappings from database instances (PS, GG), pp. 23–32.
SIGMODSIGMOD-2008-VlachouDNV #distributed #performance #query
On efficient top-k query processing in highly distributed environments (AV, CD, KN, MV), pp. 753–764.
VLDBVLDB-2008-GolabKKSY #dependence #functional #generative
On generating near-optimal tableaux for conditional functional dependencies (LG, HJK, FK, DS, BY), pp. 376–390.
VLDBVLDB-2008-HuangCDN #query
On the provenance of non-answers to queries over extracted data (JH, TC, AD, JFN), pp. 736–747.
VLDBVLDB-2008-SherkatR
On efficiently searching trajectories and archival data for historical similarities (RS, DR), pp. 896–908.
CSMRCSMR-2008-FigueiredoSGBCM #aspect-oriented #framework #maintenance #metric
On the Maintainability of Aspect-Oriented Software: A Concern-Oriented Measurement Framework (EF, CS, AG, TTB, WC, AM), pp. 183–192.
ICPCICPC-2008-HaiducM #source code #using
On the Use of Domain Terms in Source Code (SH, AM), pp. 113–122.
ICSMEICSM-2008-KothariBMS #algebra #development #performance #using
On evaluating the efficiency of software feature development using algebraic manifolds (JK, DB, SM, AS), pp. 7–16.
MSRMSR-2008-RatzingerSG #fault #predict #refactoring
On the relation of refactorings and software defect prediction (JR, TS, HCG), pp. 35–38.
SCAMSCAM-2008-BoogerdM #analysis #data flow #profiling #using
On the Use of Data Flow Analysis in Static Profiling (CB, LM), pp. 79–88.
DLTDLT-J-2007-Link08 #database #dependence #multi
On the Implication of Multivalued Dependencies in Partial Database Relations (SL), pp. 691–715.
DLTDLT-J-2007-Tamm08 #automaton
On Transition Minimality of Bideterministic Automata (HT), pp. 677–690.
AFLAFL-2008-KutribMO #automaton
On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.
AFLAFL-2008-MasopustM #automaton #multi
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.
CIAACIAA-2008-DolzhenkoJ #2d #complexity #transducer
On Complexity of Two Dimensional Languages Generated by Transducers (ED, NJ), pp. 181–190.
DLTDLT-2008-Ada #communication #complexity #nondeterminism #regular expression
On the Non-deterministic Communication Complexity of Regular Languages (AA), pp. 96–107.
DLTDLT-2008-BordihnKM #automaton #capacity #communication #finite #parallel
On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.
DLTDLT-2008-BucciLL #morphism #standard
On a Generalization of Standard Episturmian Morphisms (MB, AdL, ADL), pp. 158–169.
DLTDLT-2008-HolubN #finite #word
On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 408–418.
DLTDLT-2008-HromkovicS #automaton #bound #nondeterminism #proving
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (JH, GS), pp. 34–55.
DLTDLT-2008-Jiraskova #complexity #regular expression
On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLTDLT-2008-JiraskovaO #automaton #complexity #finite
On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
DLTDLT-2008-KapoutsisKM #automaton #complexity
On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.
DLTDLT-2008-Souza #decidability #equivalence #transducer
On the Decidability of the Equivalence for k-Valued Transducers (RdS), pp. 252–263.
ICALPICALP-A-2008-AlbersL #locality
On List Update with Locality of Reference (SA, SL), pp. 96–107.
ICALPICALP-A-2008-BodlaenderDFH #kernel #polynomial #problem
On Problems without Polynomial Kernels (HLB, RGD, MRF, DH), pp. 563–574.
ICALPICALP-A-2008-BorosEM #multi
On Berge Multiplication for Monotone Boolean Dualization (EB, KME, KM), pp. 48–59.
ICALPICALP-A-2008-KrokhinM
On the Hardness of Losing Weight (AAK, DM), pp. 662–673.
ICALPICALP-B-2008-BoigelotBB #automaton #finite #multi #set
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.
ICALPICALP-B-2008-BouyerMOW #complexity #model checking #realtime
On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.
ICALPICALP-B-2008-DawarK #datalog
On Datalog vs. LFP (AD, SK), pp. 160–171.
ICALPICALP-B-2008-JezO #equation #set
On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
ICALPICALP-C-2008-AltmannJR #black box #integer
On Black-Box Ring Extraction and Integer Factorization (KA, TJ, AR), pp. 437–448.
ICALPICALP-C-2008-HochS
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (JJH, AS), pp. 616–630.
LATALATA-2008-Altenbernd
On Bifix Systems and Generalizations (JHA), pp. 40–51.
LATALATA-2008-Kahramanogullari #concurrent #linear #logic
On Linear Logic Planning and Concurrency (OK), pp. 250–262.
LATALATA-2008-KallmeyerP #component #multi #tuple
On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) (LK, YP), pp. 263–274.
LATALATA-2008-Leupold #string #term rewriting
On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.
LATALATA-2008-MoriyaO
On Alternating Phrase-Structure Grammars (EM, FO), pp. 397–408.
LATALATA-2008-Puzynina #2d #word
On Periodicity of Generalized Two-Dimensional Words (SP), pp. 440–451.
LATALATA-2008-RegnaultST #2d #analysis #automaton #probability
On the Analysis of “Simple” 2D Stochastic Cellular Automata (DR, NS, ET), pp. 452–463.
RTARTA-2008-Ketema #combinator #normalisation #reduction
On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.
FLOPSFLOPS-2008-AbelCD #algebra #proving #type system
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory (AA, TC, PD), pp. 3–13.
GT-VMTGT-VMT-2006-Willink08 #approach #challenge #visual notation
On Challenges for a Graphical Transformation Notation and the UMLX Approach (EDW), pp. 171–179.
GT-VMTGT-VMT-2008-RensinkK #diagrams #graph #semantics #uml
On a Graph-Based Semantics for UML Class and Object Diagrams (AR, AK).
ICGTICGT-2008-BrugginkK #graph
On the Recognizability of Arrow and Graph Languages (HJSB, BK), pp. 336–350.
ICGTICGT-2008-JelinkovaK #graph
On Switching to H-Free Graphs (EJ, JK), pp. 379–395.
CHICHI-2008-VertanenK #recognition #speech #visualisation
On the benefits of confidence visualization in speech recognition (KV, POK), pp. 1497–1500.
CAiSECAiSE-2008-HaesenSLP #architecture
On the Definition of Service Granularity and Its Architectural Impact (RH, MS, WL, SP), pp. 375–389.
CAiSECAiSE-2008-KhanGGR #architecture #case study #dependence #evolution
On the Impact of Evolving Requirements-Architecture Dependencies: An Exploratory Study (SSK, PG, AG, AR), pp. 243–257.
CAiSECAiSE-2008-KumaranLW #modelling #process
On the Duality of Information-Centric and Activity-Centric Models of Business Processes (SK, RL, FYW), pp. 32–47.
CAiSECAiSE-2008-MutschlerR #information management #modelling
On Modeling and Analyzing Cost Factors in Information Systems Engineering (BM, MR), pp. 510–524.
CAiSECAiSE-2008-VanderfeestenRMAC #metric #modelling #process
On a Quest for Good Process Models: The Cross-Connectivity Metric (ITPV, HAR, JM, WMPvdA, JC), pp. 480–494.
EDOCEDOC-2008-OrriensY #collaboration #quality #specification
On the Specification and Negotiation of Quality of Service for Collaborative Services (BO, JY), pp. 316–322.
EDOCEDOC-2008-ZhuST #architecture
On Creating Industry-Wide Reference Architectures (LZ, MS, VT), pp. 24–30.
ICEISICEIS-AIDSS-2008-LampertiVZ #similarity
On Checking Temporal-Observation Subsumption in Similarity-Based Diagnosis of Active Systems (GL, FV, MZ), pp. 44–53.
ICEISICEIS-ISAS2-2008-BreemenS #concept #process
On Conceptualization as a Systematic Process (AJJvB, JJS), pp. 37–42.
CIKMCIKM-2008-ChenLYH #approach #effectiveness #graph
On effective presentation of graph patterns: a structural representative approach (CC, CXL, XY, JH), pp. 299–308.
CIKMCIKM-2008-ChoudharyMB #dataset #evolution
On quantifying changes in temporally evolving dataset (RC, SM, AB), pp. 1459–1460.
CIKMCIKM-2008-LuLH #random #similarity
On low dimensional random projections and similarity search (YEL, PL, SH), pp. 749–758.
ICMLICML-2008-KohliSRKT #multi
On partial optimality in multi-label MRFs (PK, AS, CR, VK, PHST), pp. 480–487.
ICMLICML-2008-NarayanamurthyR #markov #process #symmetry
On the hardness of finding symmetries in Markov decision processes (SMN, BR), pp. 688–695.
ICMLICML-2008-PalatucciC #classification #scalability
On the chance accuracies of large collections of classifiers (MP, AC), pp. 744–751.
ICMLICML-2008-SalakhutdinovM #analysis #network
On the quantitative analysis of deep belief networks (RS, IM), pp. 872–879.
ICMLICML-2008-WangZ #learning #multi
On multi-view active learning and the combination with semi-supervised learning (WW, ZHZ), pp. 1152–1159.
ICPRICPR-2008-DuinP #difference #learning #matrix
On refining dissimilarity matrices for an improved NN learning (RPWD, EP), pp. 1–4.
ICPRICPR-2008-HanburyS #evaluation #metric #segmentation
On segmentation evaluation metrics and region counts (AH, JS), pp. 1–4.
ICPRICPR-2008-Hernandez-RodriguezTC #classification #prototype
On the selection of base prototypes for LAESA and TLAESA classifiers (SHR, JFMT, JACO), pp. 1–4.
ICPRICPR-2008-LevadaMT #image #markov #modelling #probability #random
On the asymptotic variances of Gaussian Markov Random Field model hyperparameters in stochastic image modeling (ALML, NDAM, AT), pp. 1–4.
ICPRICPR-2008-PohK #authentication #bound #fault #multimodal #using
On using error bounds to optimize cost-sensitive multimodal biometric authentication (NP, JK), pp. 1–4.
ICPRICPR-2008-RebecchiJ #string
On the gaussian distribution of strings (SR, JMJ), pp. 1–4.
ICPRICPR-2008-UedaT #locality #scalability #using
On the scalability of robot localization using high-dimensional features (TU, KT), pp. 1–4.
ICPRICPR-2008-WangWFZ #adaptation
On edge structure based adaptive observation model for facial feature tracking (XW, YW, XF, MZ), pp. 1–4.
KDDKDD-2008-MadaniH #learning
On updates that constrain the features’ connections during learning (OM, JH), pp. 515–523.
KRKR-2008-EyerichBN #complexity
On the Complexity of Planning Operator Subsumption (PE, MB, BN), pp. 518–527.
KRKR-2008-LeeM
On Loop Formulas with Variables (JL, YM), pp. 444–453.
KRKR-2008-Meyden #distributed
On Notions of Causality and Distributed Knowledge (RvdM), pp. 209–219.
KRKR-2008-RogerHN
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle (GR, MH, BN), pp. 544–550.
SEKESEKE-2008-KhoshgoftaarSD #knowledge-based #modelling #quality
On the Rarity of Fault-prone Modules in Knowledge-based Software Quality Modeling (TMK, NS, DJD), pp. 279–284.
SIGIRSIGIR-2008-GoharianM #detection #documentation
On document splitting in passage detection (NG, SSRM), pp. 833–834.
SIGIRSIGIR-2008-LiuA #community #evolution #exclamation
On the evolution of the yahoo! answers QA community (YL, EA), pp. 737–738.
SIGIRSIGIR-2008-LuoT
On iterative intelligent medical search (GL, CT), pp. 3–10.
SIGIRSIGIR-2008-MerhavF #multi #peer-to-peer #ranking
On multiword entity ranking in peer-to-peer search (YM, OF), pp. 859–860.
ICMTICMT-2008-WongG #empirical #specification #visualisation
On Specifying and Visualising Long-Running Empirical Studies (PYHW, JG), pp. 76–90.
ECOOPECOOP-2008-SevcikA #java #memory management #program transformation
On Validity of Program Transformations in the Java Memory Model (JS, DA), pp. 27–51.
TOOLSTOOLS-EUROPE-2008-BishopH #c# #design pattern #performance
On the Efficiency of Design Patterns Implemented in C# 3.0 (JB, RNH), pp. 356–371.
AdaEuropeAdaEurope-2008-OberH #verification
On the Timed Automata-Based Verification of Ravenscar Systems (IO, NH), pp. 30–43.
LOPSTRLOPSTR-2008-Seki #semantics #set
On Negative Unfolding in the Answer Set Semantics (HS), pp. 168–184.
POPLPOPL-2008-Laud #encryption
On the computational soundness of cryptographically masked flows (PL), pp. 337–348.
QAPLQAPL-2008-Bortolussi #approximate #concurrent #constraints #equation #probability #programming
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation (LB), pp. 163–180.
SASSAS-2008-CominiDV #abstract interpretation #polymorphism #recursion #type system
On Polymorphic Recursion, Type Systems, and Abstract Interpretation (MC, FD, SV), pp. 144–158.
FSEFSE-2008-FischbeinU #behaviour #modelling
On correct and complete strong merging of partial behaviour models (DF, SU), pp. 297–307.
ICSEICSE-2008-LungAEW #re-engineering
On the difficulty of replicating human subjects studies in software engineering (JL, JA, SME, GVW), pp. 191–200.
SACSAC-2008-Al-MansariHU #semantics
On to formal semantics for path expression pointcuts (MAM, SH, RU), pp. 271–275.
SACSAC-2008-CramptonK #execution #modelling #workflow
On delegation and workflow execution models (JC, HK), pp. 2137–2144.
SACSAC-2008-Deba #approach #model transformation #modelling #transducer
On the conformity of models: a transducer-based approach for model transformation (EAD), pp. 791–796.
SACSAC-2008-LinWZW #performance #persistent #web
On the performance of persistent connection in modern web servers (XzL, HyW, JjZ, YxW), pp. 2403–2408.
SACSAC-2008-MartinsB #realtime
On the meaning of modes in uniprocessor real-time systems (PM, AB), pp. 324–325.
SACSAC-2008-MerhavF #peer-to-peer
On filtering irrelevant results in peer-to-peer search (YM, OF), pp. 1171–1172.
SACSAC-2008-SalesAP #network #performance
On the performance of TCP, UDP and DCCP over 802.11 g networks (LMdS, HOdA, AP), pp. 2074–2078.
SACSAC-2008-SantosCGAT #network #performance
On the performance of employing presence services in P2P-based network management systems (CRPdS, SLC, LZG, MJBA, LMRT), pp. 2090–2094.
SACSAC-2008-SantosSMCSGAT #design #evaluation #network #performance
On the design and performance evaluation of notification support for P2P-based network management (CRPdS, LFDS, CCM, SLC, EMS, LZG, MJBA, LMRT), pp. 2057–2062.
SACSAC-2008-SilvaCGAY #adaptation #ubiquitous
On the control of adaptation in ubiquitous computing (LCdS, CAdC, CFRG, IA, ACY), pp. 2228–2229.
SACSAC-2008-StojanovicSM #concept #refinement
On the conceptual tag refinement (NS, LS, JM), pp. 2331–2335.
GPCEGPCE-2008-KimKB #composition #feature model #interactive
On the modularity of feature interactions (CHPK, CK, DSB), pp. 23–34.
CASECASE-2008-DasSPS #aspect-oriented #assembly #hybrid #precise
On the precision alignment and hybrid assembly aspects in manufacturing of a microspectrometer (AND, JS, DOP, HES), pp. 959–966.
CCCC-2008-LogozzoF #analysis #bytecode #source code
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis (FL, MF), pp. 197–212.
DACDAC-2008-HuangYX #composition #reliability #testing
On reliable modular testing with vulnerable test access mechanisms (LH, FY, QX), pp. 834–839.
DACDAC-2008-KrishnaswamyMH #design #logic #reliability
On the role of timing masking in reliable logic circuit design (SK, ILM, JPH), pp. 924–929.
DACDAC-2008-ReddyPL #detection #testing
On tests to detect via opens in digital CMOS circuits (SMR, IP, CL), pp. 840–845.
DATEDATE-2008-DubrovaTT #analysis #feedback #synthesis
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers (ED, MT, HT), pp. 1286–1291.
DATEDATE-2008-FreuerJGN #constraints #design #higher-order #verification
On the Verification of High-Order Constraint Compliance in IC Design (JBF, GJ, JG, WN), pp. 26–31.
DATEDATE-2008-KoN08a #automation #generative #validation
On Automated Trigger Event Generation in Post-Silicon Validation (HFK, NN), pp. 256–259.
DATEDATE-2008-SreedharSK #fault #modelling #testing
On Modeling and Testing of Lithography Related Open Faults in Nano-CMOS Circuits (AS, AS, SK), pp. 616–621.
DATEDATE-2008-SterponeATG #design #fault tolerance #safety
On the design of tunable fault tolerant circuits on SRAM-based FPGAs for safety critical applications (LS, MAA, JNT, HGM), pp. 336–341.
PDPPDP-2008-BollaCRS
On the Double-Faced Nature of P2P Traffic (RB, MC, RR, MS), pp. 524–530.
PPoPPPPoPP-2008-GuerraouiK #correctness #memory management #transaction
On the correctness of transactional memory (RG, MK), pp. 175–184.
FoSSaCSFoSSaCS-2008-BaierBG #automaton #probability #problem
On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.
STOCSTOC-2008-KalaiMV #learning
On agnostic boosting and parity learning (ATK, YM, EV), pp. 629–638.
STOCSTOC-2008-KhotS #learning
On hardness of learning intersection of two halfspaces (SK, RS), pp. 345–354.
STOCSTOC-2008-OrecchiaSVV #clustering #graph
On partitioning graphs via single commodity flows (LO, LJS, UVV, NKV), pp. 461–470.
STOCSTOC-2008-Rossman #clique #complexity
On the constant-depth complexity of k-clique (BR), pp. 721–730.
TACASTACAS-2008-FismanKL #distributed #fault tolerance #protocol #verification
On Verifying Fault Tolerance of Distributed Protocols (DF, OK, YL), pp. 315–331.
TACASTACAS-2008-IhlemannJS #reasoning #verification
On Local Reasoning in Verification (CI, SJ, VSS), pp. 265–281.
TACASTACAS-2008-LegayMOW #automation #probability #source code #verification
On Automated Verification of Probabilistic Programs (AL, ASM, JO, JW), pp. 173–187.
CSLCSL-2008-BrocheninDL
On the Almighty Wand (RB, SD, ÉL), pp. 323–338.
CSLCSL-2008-Dezani-CiancagliniCGT #morphism
On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.
CSLCSL-2008-KotekMZ
On Counting Generalized Colorings (TK, JAM, BZ), pp. 339–353.
CSLCSL-2008-Saurin #λ-calculus #μ-calculus
On the Relations between the Syntactic Theories of λμ-Calculi (AS), pp. 154–168.
ICLPICLP-2008-Cipriano #constraints #modelling #programming #tool support
On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools (RC), pp. 803–804.
ICLPICLP-2008-KimmigCRDR #execution #performance #source code
On the Efficient Execution of ProbLog Programs (AK, VSC, RR, BD, LDR), pp. 175–189.
ICLPICLP-2008-MarekR
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (VWM, JBR), pp. 223–237.
ICSTICST-2008-CiupaPLOM #object-oriented #predict #random testing #testing
On the Predictability of Random Tests for Object-Oriented Software (IC, AP, AL, MO, BM), pp. 72–81.
ICSTICST-2008-SenBM #model transformation #modelling #multi #testing
On Combining Multi-formalism Knowledge to Select Models for Model Transformation Testing (SS, BB, JMM), pp. 328–337.
IJCARIJCAR-2008-HofnerS #automation #calculus
On Automating the Calculus of Relations (PH, GS), pp. 50–66.
LICSLICS-2008-AehligB #complexity
On the Computational Complexity of Cut-Reduction (KA, AB), pp. 284–293.
LICSLICS-2008-ChadhaSV #complexity #finite #monitoring
On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.
LICSLICS-2008-ChenF #axiom #equivalence
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
LICSLICS-2008-LanesePSS #calculus #decidability #higher-order #process
On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.
LICSLICS-2008-Riis #calculus #complexity #polynomial #proving
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity (SR), pp. 272–283.
VMCAIVMCAI-2008-Goldberg #simulation #verification
On Bridging Simulation and Formal Verification (EG), pp. 127–141.
ECSAECSA-2007-MolesiniGCB
On the Interplay of Crosscutting and MAS-Specific Styles (AM, AG, CC, TVB), pp. 317–320.
ECSAECSA-2007-SantAnnaFGL #architecture #composition #framework #metric
On the Modularity of Software Architectures: A Concern-Driven Measurement Framework (CS, EF, AFG, CJPdL), pp. 207–224.
TPDLECDL-2007-Bertoncini #case study #convergence #experience #library #towards
On the Move Towards the European Digital Library: BRICKS, TEL, MICHAEL and DELOS Converging Experiences (MB), pp. 440–441.
ICDARICDAR-2007-BhardwajSSS #using #verification
On the Use of Lexeme Features for Writer Verification (AB, AS, HS, SNS), pp. 1088–1092.
ICDARICDAR-2007-FinkP #modelling #recognition #using
On the Use of Context-Dependent Modeling Units for HMM-Based Offline Handwriting Recognition (GAF, TP), pp. 729–733.
ICDARICDAR-2007-FreireFMO #fuzzy
On the Applicability of Off-Line Signatures to the Fuzzy Vault Construction (MRF, JFA, MMD, JOG), pp. 1173–1177.
ICDARICDAR-2007-KumarKJ #documentation #segmentation
On Segmentation of Documents in Complex Scripts (KSSK, SK, CVJ), pp. 1243–1247.
ICDARICDAR-2007-Martinez-DiazFFO #verification
On The Effects of Sampling Rate and Interpolation in HMM-Based Dynamic Signature Verification (MMD, JFA, MRF, JOG), pp. 1113–1117.
ICDARICDAR-2007-NamboodiriNJ #using
On Using Classical Poetry Structure for Indian Language Post-Processing (AMN, PJN, CVJ), pp. 1238–1242.
ICDARICDAR-2007-SrinivasanKHS #verification
On Computing Strength of Evidence for Writer Verification (HS, SK, CH, SNS), pp. 844–848.
PODSPODS-2007-GiacomoLLR #data transformation #integration
On reconciling data exchange, data integration, and peer data management (GDG, DL, ML, RR), pp. 133–142.
PODSPODS-2007-SenellartA #complexity #probability #xml
On the complexity of managing probabilistic XML data (PS, SA), pp. 283–292.
SIGMODSIGMOD-2007-BeyerHRSG #estimation #multi
On synopses for distinct-value estimation under multiset operations (KSB, PJH, BR, YS, RG), pp. 199–210.
VLDBVLDB-2007-DDH #diagrams
On the Production of Anorexic Plan Diagrams (HD, PND, JRH), pp. 1081–1092.
VLDBVLDB-2007-LiTJE
On Dominating Your Neighborhood Profitably (CL, AKHT, WJ, ME), pp. 818–829.
VLDBVLDB-2007-WangYLLBIB #correctness #data access #database #fine-grained #relational
On the Correctness Criteria of Fine-Grained Access Control in Relational Databases (QW, TY, NL, JL, EB, KI, JWB), pp. 555–566.
VLDBVLDB-2007-WongTFX #performance
On Efficient Spatial Matching (RCWW, YT, AWCF, XX), pp. 579–590.
CSEETCSEET-2007-MeadHMRS #re-engineering #source code
On the Feasibility of Specialization within Software Engineering Degree Programs (NRM, TBH, JM, MR, DS), pp. 362–366.
ICSMEICSM-2007-HerraizGRG #evolution #predict
On the prediction of the evolution of libre software projects (IH, JMGB, GR, DMG), pp. 405–414.
SCAMSCAM-2007-LochbihlerS #dependence #graph
On Temporal Path Conditions in Dependence Graphs (AL, GS), pp. 49–58.
CIAACIAA-J-2006-CzeizlerK07 #equation #independence #word
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns (EC, JK), pp. 873–897.
CIAACIAA-J-2006-SalomaaY07 #complexity #estimation
On the State Complexity of Combined Operations and their Estimation (KS, SY), pp. 683–698.
CIAACIAA-2007-CrochemoreEGM #automaton
On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.
CIAACIAA-2007-PeltolaT #string
On String Matching in Chunked Texts (HP, JT), pp. 157–167.
DLTDLT-2007-DiekertK #first-order #word
On First-Order Fragments for Words and Mazurkiewicz Traces (VD, MK), pp. 1–19.
DLTDLT-2007-Pritykin #sequence
On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases (YP), pp. 361–370.
DLTDLT-2007-Tamm #automaton
On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.
ICALPICALP-2007-AtseriasBD #power of
On the Power of k -Consistency (AA, AAB, VD), pp. 279–290.
ICALPICALP-2007-BosnackiEGP #agile #commutative
On Commutativity Based Edge Lean Search (DB, EE, BG, DP), pp. 158–170.
ICALPICALP-2007-Coja-OghlanPS #graph #random
On the Chromatic Number of Random Graphs (ACO, KP, AS), pp. 777–788.
ICALPICALP-2007-LuTW #complexity #set
On the Complexity of Hard-Core Set Constructions (CJL, SCT, HLW), pp. 183–194.
ICALPICALP-2007-TorreP #complexity #model checking #recursion #state machine
On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
LATALATA-2007-BordihnV
On leftmost derivations in CD grammar systems (HB, GV), pp. 187–198.
LATALATA-2007-DinuGM #automaton #word
On the syllabification of words via go-through automata (LPD, RG, FM), pp. 223–236.
LATALATA-2007-MesserschmidtO #automaton #nondeterminism
On Determinism Versus Non-Determinism for Restarting Automata (HM, FO), pp. 413–424.
LATALATA-2007-Nemeth #approach #comparative
On the Regularity of Binoid Languages: A Comparative Approach (ZLN), pp. 449–460.
LATALATA-2007-StawikowskaO
On Star-Free Trace Languages and their Lexicographic Representations (KS, EO), pp. 541–552.
RTARTA-2007-HendrixM #order #specification
On the Completeness of Context-Sensitive Order-Sorted Specifications (JH, JM), pp. 229–245.
RTARTA-2007-Pfenning #logic
On a Logical Foundation for Explicit Substitutions (FP), p. 19.
RTARTA-2007-Vaux #linear
On Linear Combinations of λ-Terms (LV), pp. 374–388.
TLCATLCA-2007-Pfenning #logic
On a Logical Foundation for Explicit Substitutions (FP), p. 1.
ICFPICFP-2007-DanvyS
On Barron and Strachey’s cartesian product function (OD, JMS), pp. 41–46.
CoGCIG-2007-RiedmillerG #case study #experience #game studies #learning
On Experiences in a Complex and Competitive Gaming Domain: Reinforcement Learning Meets RoboCup (MAR, TG), pp. 17–23.
HCIHIMI-MTT-2007-ChoBKC #difference #probability #using
On Achieving Proportional Loss Differentiation Using Dynamic-MQDDP with Differential Drop Probability (KC, SB, JK, JWC), pp. 584–593.
CAiSECAiSE-2007-CappielloCP #automation #generative #web #web service
On Automated Generation of Web Service Level Agreements (CC, MC, PP), pp. 264–278.
CAiSECAiSE-2007-RollandKK #architecture
On ISOA: Intentional Services Oriented Architecture (CR, RSK, NK), pp. 158–172.
EDOCEDOC-2007-QuartelS #assessment #composition #consistency
On Interoperability and Conformance Assessment in Service Composition (DACQ, MvS), pp. 229–240.
ICEISICEIS-DISI-2007-CarterO #correctness #workflow
On correctness criteria for workflow (BMC, MEO), pp. 315–322.
ICEISICEIS-EIS-2007-MaLO #process #workflow
On Grouping of Activities Instances in Workflow Management Systems (DCM, JYCL, MEO), pp. 125–130.
ICEISICEIS-EIS-2007-Sarbo #logic
On the Logic Underlying Common Sense (JJS), pp. 395–400.
ICEISICEIS-J-2007-CarreiraGPW07a #relational
On Handling One-to-Many Transformations in Relational Systems (PC, HG, JLMP, AW), pp. 121–134.
ECIRECIR-2007-Robertson07a
On Score Distributions and Relevance (SR), pp. 40–51.
ICMLICML-2007-KropotovV #learning
On one method of non-diagonal regularization in sparse Bayesian learning (DK, DV), pp. 457–464.
ICMLICML-2007-SuttonKS
On the role of tracking in stationary environments (RSS, AK, DS), pp. 871–878.
ICMLICML-2007-WangYF #difference #learning
On learning with dissimilarity functions (LW, CY, JF), pp. 991–998.
ICMLICML-2007-XuF #learning #linear #ranking
On learning linear ranking functions for beam search (YX, AF), pp. 1047–1054.
ICMLICML-2007-ZhangY #classification #consistency #constraints
On the value of pairwise constraints in classification and consistency (JZ, RY), pp. 1111–1118.
ICMLICML-2007-ZhouX #learning #multi
On the relation between multi-instance learning and semi-supervised learning (ZHZ, JMX), pp. 1167–1174.
KDDKDD-2007-AggarwalY #classification #data type #string
On string classification in data streams (CCA, PSY), pp. 36–45.
MLDMMLDM-2007-EkdahlK #classification #learning
On Concentration of Discrete Distributions with Applications to Supervised Learning of Classifiers (ME, TK), pp. 2–16.
MLDMMLDM-2007-LeeP #multi #problem #reduction
On Applying Dimension Reduction for Multi-labeled Problems (ML, CHP), pp. 131–143.
MLDMMLDM-2007-SzepannekBW #classification
On the Combination of Locally Optimal Pairwise Classifiers (GS, BB, CW), pp. 104–116.
SEKESEKE-2007-ChenKL #adaptation #random testing #testing
On Test Case Distributions of Adaptive Random Testing (TYC, FCK, HL), pp. 141–144.
SEKESEKE-2007-ZachariasA #debugging #rule-based
On Modern Debugging For Rule-Based Systems (VZ, AA), pp. 349–353.
SIGIRSIGIR-2007-BompadaCCKS #metric #robust
On the robustness of relevance measures with incomplete judgments (TB, CCC, JC, RK, RS), pp. 359–366.
SIGIRSIGIR-2007-SchuldtGOH #retrieval
On the importance of preserving the part-order in shape retrieval (AS, BG, OO, OH), pp. 771–772.
MODELSMoDELS-2007-GasevicKH #megamodelling #metamodelling
On Metamodeling in Megamodels (DG, NK, MH), pp. 91–105.
MODELSMoDELS-2007-GasevicKH #megamodelling #metamodelling
On Metamodeling in Megamodels (DG, NK, MH), pp. 91–105.
ECOOPECOOP-2007-GreenwoodBFDGCSSBKR #design #empirical
On the Impact of Aspectual Decompositions on Design Stability: An Empirical Study (PG, TTB, EF, MD, AFG, NC, CS, SS, PB, UK, AR), pp. 176–200.
AdaEuropeAdaEurope-2007-LauLCY #detection #fault
On Detecting Double Literal Faults in Boolean Expressions (MFL, YL, TYC, YTY), pp. 55–68.
PADLPADL-2007-Rocha #evaluation #performance #robust
On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation (RR), pp. 155–169.
POPLPOPL-2007-KahlonG #analysis #automaton
On the analysis of interacting pushdown systems (VK, AG), pp. 303–314.
QAPLQAPL-2007-PierroHW #analysis #data flow #probability
On Probabilistic Techniques for Data Flow Analysis (ADP, CH, HW), pp. 59–77.
RERE-2007-Glinz #non-functional #requirements
On Non-Functional Requirements (MG), pp. 21–26.
SACSAC-MT-J-2006-JouaultK07 #model transformation #transformation language
On the interoperability of model-to-model transformation languages (FJ, IK), pp. 114–137.
ESEC-FSEESEC-FSE-2007-ParreirasSW #metamodelling #ontology #technological space
On marrying ontological and metamodeling technical spaces (FSP, SS, AW), pp. 439–448.
ESEC-FSEESEC-FSE-2007-XuCCY #automation #consistency #nondeterminism #pervasive
On impact-oriented automatic resolution of pervasive context inconsistency (CX, SCC, WKC, CY), pp. 569–572.
ICSEICSE-2007-BaresiGM #architecture #automation #verification
On Accurate Automatic Verification of Publish-Subscribe Architectures (LB, CG, LM), pp. 199–208.
ICSEICSE-2007-WilliamsLSBS #collaboration #re-engineering #student
On the Impact of a Collaborative Pedagogy on African American Millennial Students in Software Engineering (LW, LL, KMS, SBB, CBS), pp. 677–687.
SACSAC-2007-BordeauxS #constraints #framework #probability
On the stochastic constraint satisfaction framework (LB, HS), pp. 316–320.
SACSAC-2007-Chang #performance #scalability
On efficient wear leveling for large-scale flash-memory storage systems (LPC), pp. 1126–1130.
SACSAC-2007-PlattGM #detection #query #sequence #topic #using
On using user query sequence to detect off-topic search (AP, NG, SSRM), pp. 882–883.
SACSAC-2007-YangHK #framework #parallel #platform
On construction of a BioGrid platform for parallel bioinformatics applications (CTY, TFH, HCK), pp. 144–145.
CASECASE-2007-ChanYD #clustering #multi #scheduling #tool support
On the Optimality of One-Unit Cycle Scheduling of Multi-Cluster Tools with Single-Blade Robots (WKC, JY, SD), pp. 392–397.
CASECASE-2007-DotoliFM #identification #monitoring #petri net #specification
On Line Identification of Discrete Event Systems via Petri Nets: an Application to Monitor Specification (MD, MPF, AMM), pp. 893–898.
CASECASE-2007-KameshwaranVD
On Bundling and Pricing of the Service with the Product (SK, NV, VD), pp. 652–657.
CASECASE-2007-MorrisonM #clustering #throughput #tool support
On the Throughput of Clustered Photolithography Tools: Wafer Advancement and Intrinsic Equipment Loss (JRM, MKM), pp. 88–93.
CASECASE-2007-WeiJL #automation #industrial
On Protecting Industrial Automation and Control Systems against Electronic Attacks (DW, MAJ, YL), pp. 176–181.
CASECASE-2007-XiongX #fault #multi
On the Error Elimination for Multi-Axis CNC Machining (CX, YLX), pp. 412–417.
CASECASE-2007-ZhaoLZ #petri net
On Supervisory Control of a Class of Discrete Event Systems Modeled by Petri Nets (MZ, ZL, MZ), pp. 1–6.
CGOCGO-2007-BouchezDR #complexity
On the Complexity of Register Coalescing (FB, AD, FR), pp. 102–114.
DACDAC-2007-ChatterjeeMBK #equivalence #proving
On Resolution Proofs for Combinational Equivalence (SC, AM, RKB, AK), pp. 600–605.
DACDAC-2007-RastogiCK
On Estimating Impact of Loading Effect on Leakage Current in Sub-65nm Scaled CMOS Circuits Based on Newton-Raphson Method (AR, WC, SK), pp. 712–715.
DATEDATE-2007-PomeranzR #generative #testing
On test generation by input cube avoidance (IP, SMR), pp. 522–527.
LCTESLCTES-2007-BouchezDR #complexity
On the complexity of spill everywhere under SSA form (FB, AD, FR), pp. 103–112.
PDPPDP-2007-GonzalezV #fault tolerance #parallel #programming #search-based
On the Intrinsic Fault-Tolerance Nature of Parallel Genetic Programming (DLG, FFdV), pp. 450–458.
PDPPDP-2007-ShaikhKS #modelling #network #reliability
On Modeling the Reliability of Data Transport in Wireless Sensor Networks (FKS, AK, NS), pp. 395–402.
PPoPPPPoPP-2007-MamidalaNVSP #performance #scalability #trade-off #using
On using connection-oriented vs. connection-less transport for performance and scalability of collective and one-sided operations: trade-offs and impact (ARM, SN, AV, GS, DKP), pp. 46–54.
WRLAWRLA-2006-Rodriguez07 #maude #modelling #network
On Modelling Sensor Networks in Maude (DER), pp. 199–213.
ESOPESOP-2007-BlanquiHW #data type #implementation
On the Implementation of Construction Functions for Non-free Concrete Data Types (FB, TH, PW), pp. 95–109.
ESOPESOP-2007-FengFS #concurrent #logic #reasoning
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning (XF, RF, ZS), pp. 173–188.
FoSSaCSFoSSaCS-2007-LaroussinieMO #atl #complexity
On the Expressiveness and Complexity of ATL (FL, NM, GO), pp. 243–257.
FoSSaCSFoSSaCS-2007-Riba
On the Stability by Union of Reducibility Candidates (CR), pp. 317–331.
STOCSTOC-2007-Katz #multi
On achieving the “best of both worlds” in secure multiparty computation (JK), pp. 11–20.
STOCSTOC-2007-KieferLE #convergence #equation #polynomial
On the convergence of Newton’s method for monotone systems of polynomial equations (SK, ML, JE), pp. 217–226.
STOCSTOC-2007-MooreRS #algorithm #graph #morphism #quantum
On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
STOCSTOC-2007-MosselR #network #social
On the submodularity of influence in social networks (EM, SR), pp. 128–134.
TACASTACAS-2007-PandyaKL #abstraction #logic
On Sampling Abstraction of Continuous Time Logic with Durations (PKP, SNK, KL), pp. 246–260.
SMTSMT-J-2006-SeshiaSB #constraints
On Solving Boolean Combinations of UTVPI Constraints (SAS, KS, REB), pp. 67–90.
CADECADE-2007-GodoyT #normalisation #term rewriting
On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.
CAVCAV-2007-MalerNP #bound
On Synthesizing Controllers from Bounded-Response Properties (OM, DN, AP), pp. 95–107.
CSLCSL-2007-BaganDG #constant #query
On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.
CSLCSL-2007-Goller #complexity #policy #reasoning
On the Complexity of Reasoning About Dynamic Policies (SG), pp. 358–373.
ICLPICLP-2007-BaseliceBC #recursion #source code
On Finitely Recursive Programs (SB, PAB, GC), pp. 89–103.
ICLPICLP-2007-RochaSL #program transformation #prolog
On Applying Program Transformation to Implement Suspension-Based Tabling in Prolog (RR, CS, RL), pp. 444–445.
LICSLICS-2007-Goubault-Larrecq
On Noetherian Spaces (JGL), pp. 453–462.
ICSTSAT-2007-MakinoTY #problem
On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.
VMCAIVMCAI-2007-BozgaI #source code
On Flat Programs with Lists (MB, RI), pp. 122–136.
TPDLECDL-2006-Tolosana-CalasanzALNMZ #identification #metadata #problem #quality
On the Problem of Identifying the Quality of Geographic Metadata (RTC, JAÁR, JL, JNI, PRMM, FJZS), pp. 232–243.
PODSPODS-2006-KolahiL #dependence #normalisation
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF (SK, LL), pp. 114–123.
PODSPODS-2006-MachanavajjhalaG #performance #privacy
On the efficiency of checking perfect privacy (AM, JG), pp. 163–172.
PODSPODS-2006-Rosati #database #decidability #finite #query
On the decidability and finite controllability of query processing in databases with incomplete information (RR), pp. 356–365.
SIGMODSIGMOD-2006-ChandramouliXY #database #interface #network #scalability
On the database/network interface in large-scale publish/subscribe systems (BC, JX, JY), pp. 587–598.
VLDBVLDB-2006-Aggarwal #evolution
On Biased Reservoir Sampling in the Presence of Stream Evolution (CCA), pp. 607–618.
VLDBVLDB-2006-BalminBON #performance #query #xml
On the Path to Efficient XML Queries (AB, KSB, FÖ, MN), pp. 1117–1128.
CSEETCSEET-2006-JanzenS #agile #design #development #testing
On the Influence of Test-Driven Development on Software Design (DJ, HS), pp. 141–148.
ICSMEICSM-2006-Alexander #challenge #maintenance #scalability
On the Challenges of Maintaining Large-Scale Software Systems at Lockheed Martin (LDA), p. 2.
ICSMEICSM-2006-CanforaCP #co-evolution #identification #using
On the Use of Line Co-change for Identifying Crosscutting Concern Code (GC, LC, MDP), pp. 213–222.
WCREWCRE-2006-Cerulo #development #process #using
On the Use of Process Trails to Understand Software Development (LC), pp. 303–304.
WCREWCRE-2006-KothariDMS #canonical
On Computing the Canonical Features of Software Systems (JK, TD, SM, AS), pp. 93–102.
DLTDLT-J-2005-Pribavkina06 #word
On some Properties of the Language of 2-collapsing Words (EVP), pp. 665–676.
CIAACIAA-2006-CortesMR #automaton #probability #standard
On the Computation of Some Standard Distances Between Probabilistic Automata (CC, MM, AR), pp. 137–149.
CIAACIAA-2006-Yu #complexity
On the State Complexity of Combined Operations (SY), pp. 11–22.
DLTDLT-2006-Krieger #fixpoint #morphism
On Critical Exponents in Fixed Points of Non-erasing Morphisms (DK), pp. 280–291.
DLTDLT-2006-MrazOP
On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.
DLTDLT-2006-Ravikumar #automaton #finite #modelling #probability
On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.
DLTDLT-2006-SanteanY #ambiguity #finite #transducer
On Weakly Ambiguous Finite Transducers (NS, SY), pp. 156–167.
ICALPICALP-v1-2006-ChenD #2d #complexity #fixpoint #problem
On the Complexity of 2D Discrete Fixed Point Problem (XC, XD), pp. 489–500.
ICALPICALP-v1-2006-DyerGP #graph #morphism
On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
ICALPICALP-v1-2006-FiatKLOS #design #network
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (AF, HK, ML, SO, RS), pp. 608–618.
ICALPICALP-v1-2006-HoangMT #problem
On the Bipartite Unique Perfect Matching Problem (TMH, MM, TT), pp. 453–464.
ICALPICALP-v2-2006-AcetoCFI #axiom
On the Axiomatizability of Priority (LA, TC, WF, AI), pp. 480–491.
ICALPICALP-v2-2006-DodisR #quantum #using
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.
ICALPICALP-v2-2006-HarnikN #bound #hybrid #security
On Everlasting Security in the Hybrid Bounded Storage Model (DH, MN), pp. 192–203.
ICALPICALP-v2-2006-Jurdzinski #complexity #problem #safety
On Complexity of Grammars Related to the Safety Problem (TJ), pp. 432–443.
ICALPICALP-v2-2006-KariantoKT #problem #set
On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
RTARTA-2006-AntoyBC #correctness
On the Correctness of Bubbling (SA, DWB, SHC), pp. 35–49.
SEFMSEFM-2006-Arun-Kumar
On Bisimilarities Induced by Relations on Actions (SAK), pp. 41–49.
IFLIFL-2006-TrojahnerGS #array #optimisation #source code #using
On Optimising Shape-Generic Array Programs Using Symbolic Structural Information (KT, CG, SBS), pp. 1–18.
ICGTICGT-2006-BaresiS #alloy #graph transformation #using
On the Use of Alloy to Analyze Graph Transformation Systems (LB, PS), pp. 306–320.
CAiSECAiSE-2006-Franch #analysis #modelling
On the Quantitative Analysis of Agent-Oriented Models (XF), pp. 495–509.
CAiSECAiSE-2006-WeigandJABEI
On the Notion of Value Object (HW, PJ, BA, MB, AE, TI), pp. 321–335.
ICEISICEIS-DISI-2006-OommenC #database #optimisation #query
On Utilizing Attribute Cardinality Maps to Enhance Query Optimization in the Oracle Database System (BJO, JC), pp. 23–35.
ICEISICEIS-ISAS-2006-BouneffaBM #evolution #flexibility #implementation #process
On Implementing Interoperable and Flexible Software Evolution Activities (MB, HB, YM), pp. 253–260.
ICEISICEIS-J-2006-LampertiZ06a #monitoring
On Processing Temporal Observations in Monitoring of Discrete-Event Systems (GL, MZ), pp. 135–146.
ICEISICEIS-J-2006-OommenC06a #database #optimisation #query
On Enhancing Query Optimization in the Oracle Database System by Utilizing Attribute Cardinality Maps (BJO, JC), pp. 38–71.
CIKMCIKM-2006-ChuHCC #clustering
On subspace clustering with density consciousness (YHC, JWH, KTC, MSC), pp. 804–805.
CIKMCIKM-2006-HuangTOC #mining
On progressive sequential pattern mining (JWH, CYT, JCO, MSC), pp. 850–851.
CIKMCIKM-2006-NanavatiGDCDMJ #graph
On the structural properties of massive telecom call graphs: findings and implications (AAN, SG, GD, DC, KD, SM, AJ), pp. 435–444.
CIKMCIKM-2006-Robertson
On GMAP: and other transformations (SR), pp. 78–83.
ICMLICML-2006-BalcanB #formal method #learning #similarity
On a theory of learning with similarity functions (MFB, AB), pp. 73–80.
ICMLICML-2006-Banerjee #bound
On Bayesian bounds (AB), pp. 81–88.
ICPRICPR-v3-2006-SandersonG #kernel #markov #sequence
On Authorship Attribution via Markov Chains and Sequence Kernels (CS, SG), pp. 437–440.
ICPRICPR-v4-2006-KropotovPVV #kernel #principle #using
On Kernel Selection in Relevance Vector Machines Using Stability Principle (DK, NP, OV, DV), pp. 233–236.
KDDKDD-2006-AggarwalPZ #data mining #mining #privacy
On privacy preservation against adversarial data mining (CCA, JP, BZ), pp. 510–516.
KRKR-2006-BaierM #source code
On Planning with Programs that Sense (JAB, SAM), pp. 492–502.
KRKR-2006-Doyle #process
On Mechanization of Thought Processes (JD), p. 2.
KRKR-2006-SardinaGLL #nondeterminism #strict
On the Limits of Planning over Belief States under Strict Uncertainty (SS, GDG, YL, HJL), pp. 463–471.
KRKR-2006-SonT #approximate #reasoning
On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information (TCS, PHT), pp. 481–491.
SIGIRSIGIR-2006-ChenHY #concept #integration #web
On hierarchical web catalog integration with conceptual relationships in thesaurus (IXC, JCH, CZY), pp. 635–636.
SIGIRSIGIR-2006-VinayCMW #effectiveness #ranking
On ranking the effectiveness of searches (VV, IJC, NMF, KRW), pp. 398–404.
ECOOPECOOP-2006-LuP
On Ownership and Accessibility (YL, JP), pp. 99–123.
OOPSLAOOPSLA-2006-Waldo #design
On system design (JW), pp. 467–480.
LOPSTRLOPSTR-2006-WinwoodKC #automation #monitoring #synthesis
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors (SW, GK, MMTC), pp. 111–126.
PEPMPEPM-2006-CooperMG #optimisation #partial evaluation #simulation
On the application of partial evaluation to the optimisation of cardiac electrophysiological simulations (JC, SM, AG), pp. 12–20.
POPLPOPL-2006-HuntS #security
On flow-sensitive security types (SH, DS), pp. 79–90.
RERE-2006-LiaskosLYYM #analysis #variability
On Goal-based Variability Acquisition and Analysis (SL, AL, YY, ESKY, JM), pp. 76–85.
ICSEICSE-2006-ZannierMM #empirical #re-engineering
On the success of empirical studies in the international conference on software engineering (CZ, GM, FM), pp. 341–350.
SACSAC-2006-AltLM #linear #probability #problem #using
On the numerical solution to linear problems using stochastic arithmetic (RA, JLL, SM), pp. 1635–1639.
SACSAC-2006-Bellur #consistency #object-oriented #using #workflow
On using OO techniques to establish workflow conformance (UB), pp. 1447–1448.
SACSAC-2006-ChenC #representation #transitive
On the transitive closure representation and adjustable compression (YC, DC), pp. 450–455.
SACSAC-2006-ChoRJ #embedded #realtime #scheduling
On utility accrual processor scheduling with wait-free synchronization for embedded real-time software (HC, BR, EDJ), pp. 918–922.
SACSAC-2006-ColletOR #behaviour #component
On contracting different behavioral properties in component-based systems (PC, AO, NR), pp. 1798–1799.
SACSAC-2006-Fasli
On the relationship between roles and power: preliminary report (MF), pp. 313–318.
SACSAC-2006-GuoW #data mining #mining #privacy #using
On the use of spectral filtering for privacy preserving data mining (SG, XW), pp. 622–626.
SACSAC-2006-JouaultK #architecture #atl #qvt
On the architectural alignment of ATL and QVT (FJ, IK), pp. 1188–1195.
SACSAC-2006-Lindgren
On handling conflicts between rules with numerical features (TL), pp. 37–41.
SACSAC-2006-SimpsonPS #health
On tracker attacks in health grids (ACS, DJP, MS), pp. 209–216.
SACSAC-2006-WuRJ #bound #embedded #energy #realtime
On bounding energy consumption in dynamic, embedded real-time systems (HW, BR, EDJ), pp. 933–934.
CASECASE-2006-GuoLX #modelling #petri net #using
On Modeling a Soccer Robot System Using Petri Nets (BG, ZL, SX), pp. 460–465.
DATEDATE-2006-BombieriFP #evaluation #reuse #verification
On the evaluation of transactor-based verification for reusing TLM assertions and testbenches at RTL (NB, FF, GP), pp. 1007–1012.
DATEDATE-2006-FeySVD #satisfiability
On the relation between simulation-based and SAT-based diagnosis (GF, SS, AGV, RD), pp. 1139–1144.
DATEDATE-2006-HassenT #probability #term rewriting #verification
On the numerical verification of probabilistic rewriting systems (JBH, ST), pp. 1223–1224.
DATEDATE-2006-KrusemanH #detection #fault
On test conditions for the detection of open defects (BK, MH), pp. 896–901.
DATEDATE-DF-2006-ZarriCDMPRT #protocol #verification
On the verification of automotive protocols (GZ, FC, FD, RM, MP, GR, CT), pp. 195–200.
HPDCHPDC-2006-Casanova
On the Harmfulness of Redundant Batch Requests (HC), pp. 255–266.
PDPPDP-2006-HartikainenLM #java #memory management #mobile
On Mobile Java Memory Consumption (VMH, PPL, TM), pp. 333–339.
PDPPDP-2006-SouzaRYLC #distributed #network #on-demand
On the Relevance of Network Topologies in Distributed Video-on-Demand Servers (LS, AR, XY, EL, FC), pp. 396–404.
FoSSaCSFoSSaCS-2006-BlanquiKR #confluence #λ-calculus
On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.
FoSSaCSFoSSaCS-2006-ChenFN #finite #infinity #simulation
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
FoSSaCSFoSSaCS-2006-Gorla #communication #power of
On the Relative Expressive Power of Asynchronous Communication Primitives (DG), pp. 47–62.
FoSSaCSFoSSaCS-2006-OuaknineW #logic #metric #turing machine
On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
FoSSaCSFoSSaCS-2006-Rohde #calculus #μ-calculus
On the μ-Calculus Augmented with Sabotage (PR), pp. 142–156.
STOCSTOC-2006-AchlioptasR #constraints #geometry #problem #random
On the solution-space geometry of random constraint satisfaction problems (DA, FRT), pp. 130–139.
STOCSTOC-2006-AkaviaGGM #np-hard
On basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 701–710.
STOCSTOC-2006-AryaMM
On the importance of idempotence (SA, TM, DMM), pp. 564–573.
STOCSTOC-2006-DinurFKO #bound #fourier
On the fourier tails of bounded functions over the discrete cube (ID, EF, GK, RO), pp. 437–446.
STOCSTOC-2006-DubrovI #complexity #performance
On the randomness complexity of efficient sampling (BD, YI), pp. 711–720.
STOCSTOC-2006-Feige
On maximizing welfare when utility functions are subadditive (UF), pp. 41–50.
STOCSTOC-2006-KarloffKMR #distance #metric
On earthmover distance, metric labeling, and 0-extension (HJK, SK, AM, YR), pp. 547–556.
STOCSTOC-2006-PanagiotouS #metric #performance
On adequate performance measures for paging (KP, AS), pp. 487–496.
CSLCSL-2006-CarayolM
On Rational Trees (AC, CM), pp. 225–239.
CSLCSL-2006-Marcinkowski #graph #logic #power of
On the Expressive Power of Graph Logic (JM), pp. 486–500.
IJCARIJCAR-2006-TomanW #dependence #functional #logic
On Keys and Functional Dependencies as First-Class Citizens in Description Logics (DT, GEW), pp. 647–661.
IJCARIJCAR-2006-Werner
On the Strength of Proof-Irrelevant Type Theories (BW), pp. 604–618.
LICSLICS-2006-KissV #congruence
On Tractability and Congruence Distributivity (EWK, MV), pp. 221–230.
LICSLICS-2006-Ong #higher-order #model checking #recursion
On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.
LICSLICS-2006-PalamidessiSVV #persistent #π-calculus
On the Expressiveness of Linearity vs Persistence in the Asychronous π-Calculus (CP, VAS, FDV, BV), pp. 59–68.
LICSLICS-2006-TerauchiA #polymorphism #recursion
On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.
ICSTSAT-2006-FuM #problem #satisfiability
On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.
ICSTSAT-2006-NieuwenhuisO #modulo theories #optimisation #problem #satisfiability
On SAT Modulo Theories and Optimization Problems (RN, AO), pp. 156–169.
ICSTSAT-2006-PorschenSR #linear
On Linear CNF Formulas (SP, ES, BR), pp. 212–225.
WICSAWICSA-2005-Chikofsky #architecture #reverse engineering
On the Meeting of Software Architecture and Reverse Engineering (EJC), pp. 17–24.
DRRDRR-2005-RusuG #challenge #image
On the challenges that handwritten text images pose to computers and new practical applications (AIR, VG), pp. 84–91.
TPDLECDL-2005-SaidisPN #approach #effectiveness #prototype
On the Effective Manipulation of Digital Objects: A Prototype-Based Instantiation Approach (KS, GP, MN), pp. 13–24.
HTHT-2005-GahleitnerBPW #ontology
On cooperatively creating dynamic ontologies (EG, WB, JP, ERW), pp. 208–210.
ICDARICDAR-2005-ChaYT #metric #recognition #similarity
On Binary Similarity Measures for Handwritten Character Recognition (SHC, SY, CCT), pp. 4–8.
ICDARICDAR-2005-FinkP #feature model #independence #recognition
On Appearance-Based Feature Extraction Methods for Writer-Independent Handwritten Text Recognition (GAF, TP), pp. 1070–1074.
ICDARICDAR-2005-GarainPH #documentation #image #quality
On Foreground-Background Separation in Low Quality Color Document Images (UG, TP, LH), pp. 585–589.
JCDLJCDL-2005-TsaiW #music
On the extraction of vocal-related information to facilitate the management of popular music collections (WHT, HMW), pp. 197–206.
JCDLJCDL-2005-ZongWSLG #web
On assigning place names to geography related web pages (WZ, DW, AS, EPL, DHLG), pp. 354–362.
PODSPODS-2005-Koch #complexity #functional #query #recursion #xquery
On the complexity of nonrecursive XQuery and functional query languages on complex values (CK), pp. 84–97.
PODSPODS-2005-LeindersB #algebra #complexity #relational #set
On the complexity of division and set joins in the relational algebra (DL, JVdB), pp. 76–83.
SIGMODSIGMOD-2005-ChenLL #pattern matching #using #xml
On Boosting Holism in XML Twig Pattern Matching using Structural Indexing Techniques (TC, JL, TWL), pp. 455–466.
SIGMODSIGMOD-2005-XieYC #probability
On Joining and Caching Stochastic Streams (JX, JY, YC), pp. 359–370.
VLDBVLDB-2005-Aggarwal
On k-Anonymity and the Curse of Dimensionality (CCA), pp. 901–909.
VLDBVLDB-2005-BrakatsoulasPSW
On Map-Matching Vehicle Tracking Data (SB, DP, RS, CW), pp. 853–864.
VLDBVLDB-2005-XiaZKD
On Computing Top-t Most Influential Spatial Sites (TX, DZ, EK, YD), pp. 946–957.
IWPCIWPC-2005-HogganvikS #comprehension #security
On the Comprehension of Security Risk Scenarios (IH, KS), pp. 115–124.
IWPCIWPC-2005-SunW #comprehension #diagrams #layout #uml
On Evaluating the Layout of UML Class Diagrams for Program Comprehension (DS, KW), pp. 317–326.
DLTDLT-J-2004-IbarraYD05 #parallel
On various notions of parallelism in P Systems (OHI, HCY, ZD), pp. 683–705.
CIAACIAA-2005-IbarraY
On Deterministic Catalytic Systems (OHI, HCY), pp. 163–175.
CIAACIAA-2005-PodlovchenkoRZ #equivalence #problem #source code
On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.
CIAACIAA-2005-VielhaberC #infinity #set #transducer
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.
CIAACIAA-2005-ZdarekM #2d #automaton #finite #pattern matching
On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.
DLTDLT-2005-BellP #matrix
On the Membership of Invertible Diagonal Matrices (PB, IP), pp. 146–157.
DLTDLT-2005-GruberHKK #automaton
On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.
DLTDLT-2005-KariKST #word
On Hairpin-Free Words and Languages (LK, SK, PS, GT), pp. 296–307.
DLTDLT-2005-Kunc #set
On Language Inequalities XK subset of LX (MK), pp. 327–337.
DLTDLT-2005-Pribavkina #word
On Some Properties of the Language of 2-Collapsing Words (EVP), pp. 374–384.
DLTDLT-2005-Saari #sequence
On the Frequency of Letters in Pure Binary Morphic Sequences (KS), pp. 397–408.
ICALPICALP-2005-AvinE #geometry #graph #random
On the Cover Time of Random Geometric Graphs (CA, GE), pp. 677–689.
ICALPICALP-2005-BealLS #equivalence
On the Equivalence of -Automata (MPB, SL, JS), pp. 397–409.
ICALPICALP-2005-CaryRS #finite #metric
On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), pp. 1412–1423.
ICALPICALP-2005-ChlebusGKR #network #problem
On the Wake-Up Problem in Radio Networks (BSC, LG, DRK, TR), pp. 347–359.
ICALPICALP-2005-EfthymiouS #graph #random
On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
ICALPICALP-2005-Hopper #security
On Steganographic Chosen Covertext Security (NH), pp. 311–323.
ICALPICALP-2005-PatrascuP #complexity
On Dynamic Bit-Probe Complexity (CEP, MP), pp. 969–981.
ICALPICALP-2005-RadhakrishnanRS #fourier #power of #problem #random
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (JR, MR, PS), pp. 1399–1411.
ICALPICALP-2005-Wee
On Round-Efficient Argument Systems (HW), pp. 140–152.
ICALPICALP-2005-Wikstrom #integer
On the l-Ary GCD-Algorithm in Rings of Integers (DW), pp. 1189–1201.
FMFM-2005-Bosnacki #abstraction #calculus #μ-calculus
On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.
FMFM-2005-IyerSEJ #clustering #model checking
On Partitioning and Symbolic Model Checking (SKI, DS, EAE, JJ), pp. 497–511.
RTARTA-2005-BouajjaniT #process #reachability #set #term rewriting
On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
RTARTA-2005-GeserHWZ #automaton #linear #term rewriting #termination
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
SEFMSEFM-2005-Hameurlain #behaviour #component #protocol
On Compatibility and Behavioural Substitutability of Component Protocols (NH), pp. 394–403.
SEFMSEFM-2005-PapCD #formal method
On the Theory of Patching (ZP, GC, SD), pp. 263–271.
TLCATLCA-2005-Herbelin #logic
On the Degeneracy of Σ-Types in Presence of Computational Classical Logic (HH), pp. 209–220.
CoGCIG-2005-Burns05a
On TRACS: Dealing with a Deck of Double-Sided Cards (KB).
DiGRADiGRA-2005-Salazar #ontology #research
On the Ontology of MMORPG Beings: A Theorethical Model for Research (JS).
DiGRADiGRA-2005-Sicart #game studies
On the Foundations of Evil in Computer Game Cheating (MS).
SOFTVISSOFTVIS-2005-StoreyCG #development #framework #overview #process #using #visualisation
On the use of visualization to support awareness of human activities in software development: a survey and a framework (MADS, DC, DMG), pp. 193–202.
CAiSECAiSE-2005-Franch #lightweight #modelling #using
On the Lightweight Use of Goal-Oriented Models for Software Package Selection (XF), pp. 551–566.
CAiSECAiSE-2005-PetrovJH #consistency #metadata #repository
On the Notion of Consistency in Metadata Repository Systems (IP, SJ, MH), pp. 90–104.
ICEISICEIS-v1-2005-ChenC #database #documentation #evaluation #query
On the Tree Inclusion and Query Evaluation in Document Databases (YC, YC), pp. 182–190.
CIKMCIKM-2005-GoharianM #detection #information management #topic
On off-topic access detection in information systems (NG, LM), pp. 353–354.
CIKMCIKM-2005-GrecoS #complexity #consistency #integration #peer-to-peer #query
On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems (GG, FS), pp. 36–43.
CIKMCIKM-2005-LaurNSP #data type #estimation
On the estimation of frequent itemsets for data streams: theory and experiments (PAL, RN, JES, PP), pp. 327–328.
CIKMCIKM-2005-LiLLY #performance #xml
On reducing redundancy and improving efficiency of XML labeling schemes (CL, TWL, JL, TY), pp. 225–226.
ECIRECIR-2005-MartonWH #classification
On Compression-Based Text Classification (YM, NW, LH), pp. 300–314.
KDDKDD-2005-PeiJZ #clique #mining
On mining cross-graph quasi-cliques (JP, DJ, AZ), pp. 228–238.
KDDKDD-2005-Sandler #classification #linear #programming #using
On the use of linear programming for unsupervised text classification (MS), pp. 256–264.
LSOLSO-2005-VillelaRT #development
On the Importance Attributed to Different Knowledge in Software Development Environments (KV, ARR, GT), pp. 97–101.
MLDMMLDM-2005-KoK #classification
On ECOC as Binary Ensemble Classifiers (JK, EK), pp. 1–10.
SEKESEKE-2005-ChenKZ #adaptation #effectiveness #random testing #testing
On the Relationships between the Distribution of Failure-Causing Inputs and Effectiveness of Adaptive Random Testing (TYC, FCK, ZZ), pp. 306–311.
SEKESEKE-2005-Kjaergaard #abstraction #architecture
On Abstraction Levels for Software Architecture Viewpoints (MBK), pp. 424–429.
SEKESEKE-2005-WuSC #web
On the Web Data Extraction Model (ICW, JYS, LBC), pp. 330–335.
SIGIRSIGIR-2005-CarvalhoC #classification #email #speech
On the collective classification of email “speech acts” (VRdC, WWC), pp. 345–352.
SIGIRSIGIR-2005-ElsayedO #adaptation #evaluation #topic
On evaluation of adaptive topic tracking systems (TE, DWO), pp. 597–598.
SIGIRSIGIR-2005-ZhouG #categorisation #corpus #geometry
On redundancy of training corpus for text categorization: a perspective of geometry (SZ, JG), pp. 671–672.
ECMFAECMDA-FA-2005-MullerCCV
On Some Properties of Parameterized Model Application (AM, OC, BC, GV), pp. 130–144.
ECMFAECMDA-FA-2005-SteinHU #modelling #query
On Relationships Between Query Models (DS, SH, RU), pp. 254–268.
QAPLQAPL-2004-AldiniP05 #analysis #probability #protocol
On Quantitative Analysis of Probabilistic Protocols (AA, ADP), pp. 131–148.
RERE-2005-CrookIN #modelling #policy
On Modelling Access Policies: Relating Roles to their Organisational Context (RC, DCI, BN), pp. 157–166.
ASEASE-2005-KoschkeQ #feature model
On dynamic feature location (RK, JQ), pp. 86–95.
GTTSEGTTSE-2005-Mens #graph transformation #refactoring #using
On the Use of Graph Transformations for Model Refactoring (TM), pp. 219–257.
ICSEICSE-2005-Ciancarini #education
On the education of future software engineers (PC), pp. 649–650.
SACSAC-2005-DantchevV #infinity
On the computational limits of infinite satisfaction (SSD, FDV), pp. 393–397.
SACSAC-2005-Goualard #algorithm #constraints #theorem proving
On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure (FG), pp. 1434–1438.
SACSAC-2005-GriffinSC #case study #design #embedded #garbage collection #java #power management
On designing a low-power garbage collector for java embedded devices: a case study (PAG, WSa, JMC), pp. 868–873.
SACSAC-2005-XiaoLJ #clustering #problem #scheduling
On unit task linear-nonlinear two-cluster scheduling problem (ZX, WNL, JJFJ), pp. 713–717.
SACSAC-2005-YeeF #peer-to-peer
On search in peer-to-peer file sharing systems (WGY, OF), pp. 1023–1030.
SACSAC-OOPS-J-2005-ViroliR #java #strict
On Access Restriction with Java Wildcards (MV, GR), pp. 117–139.
ATEMATEM-2004-KarailaS05 #case study #industrial #metadata #reuse #reverse engineering #visual notation
On the Role of Metadata in Visual Language Reuse and Reverse Engineering — An Industrial Case (MK, TS), pp. 29–41.
GPCEGPCE-2005-AliasB #domain-specific language #re-engineering
On Domain-Specific Languages Reengineering (CA, DB), pp. 63–77.
CASECASE-2005-GoemansLGS #design
On the design of guillotine traps for vibratory bowl feeders (OCG, AL, KG, AFvdS), pp. 79–86.
CASECASE-2005-LowWW #development #realtime #using
On the development of a real time control system by using xPC Target: solution to robotic system control (KHL, HW, MYW), pp. 345–350.
DACDAC-2005-Najm #analysis #statistics
On the need for statistical timing analysis (FNN), pp. 764–765.
DATEDATE-2005-KastensmidtSCR #composition #design #logic
On the Optimal Design of Triple Modular Redundancy Logic for SRAM-based FPGAs (FLK, LS, LC, MSR), pp. 1290–1295.
DATEDATE-2005-MangassarianA #analysis #statistics
On Statistical Timing Analysis with Inter- and Intra-Die Variations (HM, MA), pp. 132–137.
DATEDATE-2005-SchianoOLPS #analysis #fault #reliability
On the Analysis of Reed Solomon Coding for Resilience to Transient/Permanent Faults in Highly Reliable Memories (LS, MO, FL, SP, AS), pp. 580–585.
HPCAHPCA-2005-MengSK #power management #reduction
On the Limits of Leakage Power Reduction in Caches (YM, TS, RK), pp. 154–165.
LCTESLCTES-2005-Oi #design #hardware #java #virtual machine
On the design of the local variable cache in a hardware translation-based java virtual machine (HO), pp. 87–94.
PDPPDP-2005-CalafateMM #ad hoc #interactive #mobile #network #protocol
On the Interaction Between IEEE 802.11e and Routing Protocols in Mobile Ad-Hoc Networks (CMTC, PM, MPM), pp. 110–117.
FASEFASE-2005-BergGJLRS #consistency #testing
On the Correspondence Between Conformance Testing and Regular Inference (TB, OG, BJ, ML, HR, BS), pp. 175–189.
FoSSaCSFoSSaCS-2005-BozgaI #decidability
On Decidability Within the Arithmetic of Addition and Divisibility (MB, RI), pp. 425–439.
STOCSTOC-2005-AchlioptasCKM #bias #graph
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs (DA, AC, DK, CM), pp. 694–703.
STOCSTOC-2005-CharikarK #design #multi #network
On non-uniform multicommodity buy-at-bulk network design (MC, AK), pp. 176–182.
STOCSTOC-2005-ChenD #algorithm #approximate #fixpoint
On algorithms for discrete and approximate brouwer fixed points (XC, XD), pp. 323–330.
STOCSTOC-2005-FlaxmanFV #algorithm #approximate #performance #problem
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
STOCSTOC-2005-JansenS
On strip packing With rotations (KJ, RvS), pp. 755–761.
STOCSTOC-2005-MortensenPP
On dynamic range reporting in one dimension (CWM, RP, MP), pp. 104–111.
STOCSTOC-2005-Regev #encryption #fault #learning #linear #random
On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.
STOCSTOC-2005-TaoV #matrix #random
On random pm 1 matrices: singularity and determinant (TT, VHV), pp. 431–440.
STOCSTOC-2005-Trevisan
On uniform amplification of hardness in NP (LT), pp. 31–38.
STOCSTOC-2005-Wee #obfuscation
On obfuscating point functions (HW), pp. 523–532.
TACASTACAS-2005-Jiang #invariant
On Some Transformation Invariants Under Retiming and Resynthesis (JHRJ), pp. 413–428.
CADECADE-2005-VermaSS #complexity #equation #horn clause
On the Complexity of Equational Horn Clauses (KNV, HS, TS), pp. 337–352.
CAVCAV-2005-SenVA #model checking #probability #statistics
On Statistical Model Checking of Stochastic Systems (KS, MV, GA), pp. 266–280.
CSLCSL-2005-BarrasG #calculus #induction
On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.
CSLCSL-2005-CateF #complexity #hybrid #logic
On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
CSLCSL-2005-CollinsonPR #morphism #polymorphism
On Bunched Polymorphism (MC, DJP, ER), pp. 36–50.
CSLCSL-2005-Murlak
On Deciding Topological Classes of Deterministic Tree Languages (FM), pp. 428–441.
ICLPICLP-2005-GiunchigliaM #satisfiability #set
On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) (EG, MM), pp. 37–51.
LICSLICS-2005-Atserias #problem
On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.
LICSLICS-2005-Niemisto #locality #reduction
On Locality and Uniform Reduction (HN), pp. 41–50.
LICSLICS-2005-OuaknineW #decidability #logic #metric
On the Decidability of Metric Temporal Logic (JO, JW), pp. 188–197.
ICSTSAT-2005-LiffitonS #satisfiability
On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.
ICSTSAT-2005-ManquinhoM #algorithm #optimisation #pseudo
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization (VMM, JPMS), pp. 451–458.
ICSTSAT-2005-Zhang #on the fly
On Subsumption Removal and On-the-Fly CNF Simplification (LZ), pp. 482–489.
ICTSSTestCom-2005-PapCD #fault
On FSM-Based Fault Diagnosis (ZP, GC, SD), pp. 159–174.
VMCAIVMCAI-2005-KumarKV #complexity #fault
On the Complexity of Error Explanation (NK, VK, MV), pp. 448–464.
DocEngDocEng-2004-ChuangL #composition
On modular transformation of structural content (TRC, JLL), pp. 201–210.
PODSPODS-2004-AtseriasDK #morphism #query
On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
PODSPODS-2004-Bar-YossefFJ #evaluation #memory management #requirements #xml #xpath
On the Memory Requirements of XPath Evaluation over XML Streams (ZBY, MF, VJ), pp. 177–188.
PODSPODS-2004-Bonatti #datalog #decidability #query #recursion
On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
PODSPODS-2004-MeyersonW #complexity
On the Complexity of Optimal K-Anonymity (AM, RW), pp. 223–228.
SIGMODSIGMOD-2004-KaushikKNR #integration
On the Integration of Structure Indexes and Inverted Lists (RK, RK, JFN, RR), pp. 779–790.
VLDBVLDB-2004-ChenN #distance #edit distance
On The Marriage of Lp-norms and Edit Distance (LC, RTN), pp. 792–803.
VLDBVLDB-2004-LakshmananRWZ #query #satisfiability #testing
On Testing Satisfiability of Tree Pattern Queries (LVSL, GR, WHW, Z(Z), pp. 120–131.
VLDBVLDB-2004-WuOS #performance
On the performance of bitmap indices for high cardinality attributes (KW, EJO, AS), pp. 24–35.
CSEETCSEET-2004-SrikanthWWMB
On Pair Rotation in the Computer Science Course (HS, LAW, EW, CM, SB), pp. 144–149.
ITiCSEITiCSE-2004-ArmoniG #modelling #student
On the achievements of high school students studying computational models (MA, JGE), pp. 17–21.
IWPCIWPC-2004-FossW #framework #legacy #migration #platform
On Migrating a Legacy Application to the Palm Platform (AF, KW), pp. 231–235.
CIAACIAA-2004-BerstelC #algorithm #complexity
On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAACIAA-2004-ZakharovZ #automaton #multi #problem #source code
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
DLTDLT-2004-BeekCHV
On Competence in CD Grammar Systems (MHtB, ECV, MH, GV), pp. 76–88.
DLTDLT-2004-ChoffrutGL
On the Maximum Coefficients of Rational Formal Series in Commuting Variables (CC, MG, VL), pp. 114–126.
DLTDLT-2004-DaleyD
On Codes Defined by Bio-Operations (MD, MD), pp. 127–138.
DLTDLT-2004-JurdzinskiOMP #automaton #complexity
On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.
DLTDLT-2004-JurdzinskiOMP04a #automaton
On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.
DLTDLT-2004-KurganskyyP #2d #automaton #finite #power of
On the Computation Power of Finite Automata in Two-dimensional Environments (OK, IP), pp. 261–271.
DLTDLT-2004-Reidenbach #equivalence #pattern matching #problem
On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.
DLTDLT-2004-Staiger
On the Hausdorff Measure of ω-Power Languages (LS), pp. 393–405.
ICALPICALP-2004-FeigenbaumKMSZ #graph #problem
On Graph Problems in a Semi-streaming Model (JF, SK, AM, SS, JZ), pp. 531–543.
ICALPICALP-2004-Schweikardt #fixpoint #logic #monad #power of
On the Expressive Power of Monadic Least Fixed Point Logic (NS), pp. 1123–1135.
ICALPICALP-2004-Volzer #distributed
On Randomization Versus Synchronization in Distributed Systems (HV), pp. 1214–1226.
ICALPICALP-2004-Zhang #bound #power of
On the Power of Ambainis’s Lower Bounds (SZ), pp. 1238–1250.
RTARTA-2004-Simonsen #composition #confluence #term rewriting
On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
SEFMSEFM-2004-MengNB #algebra #perspective #refinement #semantics #uml
On Semantics and Refinement of UML Statecharts: A Coalgebraic View (SM, ZN, LSB), pp. 164–173.
SFMSFM-2004-Selic #semantics #standard #uml
On the Semantic Foundations of Standard UML 2.0 (BS), pp. 181–199.
EDOCEDOC-2004-AlmeidaDSP #development #framework #platform
On the Notion of Abstract Platform in MDA Development (JPAA, RMD, MvS, LFP), pp. 253–263.
ICEISICEIS-v3-2004-ChapmanS #enterprise #guidelines #security
On Information Security Guidelines for Small/Medium Enterprises (DC, LS), pp. 3–9.
ICEISICEIS-v4-2004-LeDG #multi #ontology #problem #semantics #web
On Ontology Matching Problems — for Building a Corporate Semantic Web in a Multi-Communities Organization (BTL, RDK, FG), pp. 236–243.
CIKMCIKM-2004-ChundiR #documentation
On lossy time decompositions of time stamped documents (PC, DJR), pp. 437–445.
CIKMCIKM-2004-KumaranH #multi #relational #semantics
On semantic matching of multilingual attributes in relational systems (AK, JRH), pp. 230–231.
CIKMCIKM-2004-LiOM #clustering #multi
On combining multiple clusterings (TL, MO, SM), pp. 294–303.
CIKMCIKM-2004-MasonCV #traceability
On structuring formal, semi-formal and informal data to support traceability in systems engineering environments (PM, KC, PV), pp. 642–651.
ICPRICPR-v1-2004-MansillaH #classification
On Classifier Domains of Competence (EBiM, TKH), pp. 136–139.
ICPRICPR-v1-2004-PopoviciTRM #algorithm #detection #evaluation #locality #performance
On Performance Evaluation of Face Detection and Localization Algorithms (VP, JPT, YR, SM), pp. 313–317.
ICPRICPR-v2-2004-GritaiSS #analysis #invariant #using
On the use of Anthropometry in the Invariant Analysis of Human Actions (AG, YS, MS), pp. 923–926.
ICPRICPR-v2-2004-KampelS #3d #symmetry
On 3D Mosaicing of Rotationally Symmetric Ceramic Fragments (MK, RS), pp. 265–268.
ICPRICPR-v4-2004-ViguerasBS #multi
On the Influence of Fixing the Principal Point in Frame-by-Frame Multiplanar Calibration (JFV, MOB, GS), pp. 120–123.
ICPRICPR-v4-2004-YuWT #estimation
On Estimation of Secret Message Length in JSteg-like Steganography (XY, YW, TT), pp. 673–676.
KDDKDD-2004-AggarwalHWY #classification #data type
On demand classification of data streams (CCA, JH, JW, PSY), pp. 503–508.
KDDKDD-2004-Iyengar #clustering #detection
On detecting space-time clusters (VSI), pp. 587–592.
KDDKDD-2004-ZhangPT #statistics
On the discovery of significant statistical quantitative rules (HZ, BP, AT), pp. 374–383.
KRKR-2004-AmgoudC #using
On the Use of an ATMS for Handling Conflicting Desires (LA, CC), pp. 194–202.
KRKR-2004-EiterFTW #logic programming
On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.
KRKR-2004-EveraereKM
On Merging Strategy-Proofness (PE, SK, PM), pp. 357–368.
SEKESEKE-2004-Stojanovic #approach #modelling
On Modelling an e-shop Application on the Knowledge Level: e-ShopAgent Approach (NS), pp. 232–237.
SIGIRSIGIR-2004-Soboroff #documentation #web
On evaluating web search with very few relevant documents (IS), pp. 530–531.
SIGIRSIGIR-2004-TangDX #peer-to-peer #scalability #semantics
On scaling latent semantic indexing for large peer-to-peer systems (CT, SD, ZX), pp. 112–121.
SPLCSPLC-2004-Bosch #component #development #product line
On the Development of Software Product-Family Components (JB), pp. 146–164.
UMLUML-2004-JiangSZMMM #classification #metamodelling #uml
On the Classification of UML’s Meta Model Extension Mechanism (YJ, WS, LZ, ZM, XM, HM), pp. 54–68.
AdaEuropeAdaEurope-2004-BurgstallerBS #ada #source code
On the Tree Width of Ada Programs (BB, JB, BS), pp. 78–90.
AdaEuropeAdaEurope-2004-Olive #concept #development #information management
On the Role of Conceptual Schemas in Information Systems Development (AO), pp. 16–34.
LOPSTRLOPSTR-2004-SerebrenikM #source code #termination
On Termination of Binary CLP Programs (AS, FM), pp. 231–244.
LOPSTRPDCL-2004-Brogi #composition #logic programming #semantics
On the Semantics of Logic Program Composition (AB), pp. 115–151.
LOPSTRPDCL-2004-MartinK
On the Inference of Natural Level Mappings (JCM, AK), pp. 432–452.
SASSAS-2004-BozgaIL #alias #logic
On Logics of Aliasing (MB, RI, YL), pp. 344–360.
SACSAC-J-2003-BorgerCR04 #formal method #state machine #uml #using
On formalizing UML state machines using ASM (EB, AC, ER), pp. 287–292.
SACSAC-J-2003-MeloM04 #composition #framework #java
On the composition of Java frameworks control-flows (ACVdM, BMM), pp. 301–307.
SACSAC-J-2003-YuNPC04 #testing
On the testing methods used by beginning software testers (YTY, SPN, PLP, TYC), pp. 329–335.
SACSAC-2004-BaralisCG #classification
On support thresholds in associative classification (EB, SC, PG), pp. 553–558.
SACSAC-2004-PardedeRT #using #xml
On using collection for aggregation and association relationships in XML object-relational storage (EP, JWR, DT), pp. 703–710.
SACSAC-2004-ZumpanoGTV #optimisation #power of #problem #semantics
On the semantics and expressive power of Datalog-like languages for NP search and optimization problems (EZ, SG, IT, PV), pp. 692–697.
SACSAC-PL-J-2004-DamianiDG #classification #multi #thread
On Re-classification and Multi-threading (FD, MDC, PG), pp. 5–30.
GPCEGPCE-2004-LawallMM #component #design #domain-specific language #independence
On Designing a Target-Independent DSL for Safe OS Process-Scheduling Components (JLL, AFLM, GM), pp. 436–455.
DACDAC-2004-LiRP #fault #generative #testing
On test generation for transition faults with minimized peak power dissipation (WL, SMR, IP), pp. 504–509.
DACDAC-2004-Pomeranz #functional #generative #testing
On the generation of scan-based test sets with reachable states for testing under functional operation conditions (IP), pp. 928–933.
DACDAC-2004-RanM #configuration management #design
On designing via-configurable cell blocks for regular fabrics (YR, MMS), pp. 198–203.
DACDAC-2004-WangMCA #learning
On path-based learning and its applications in delay test and diagnosis (LCW, TMM, KTC, MSA), pp. 492–497.
DATEDATE-v1-2004-AlmukhaizimDM #bound #concurrent #detection #fault #latency
On Concurrent Error Detection with Bounded Latency in FSMs (SA, PD, YM), pp. 596–603.
DATEDATE-v1-2004-Cao #power management
On Transfer Function and Power Consumption Transient Response (LC), pp. 688–689.
PDPPDP-2004-VilayannurRCTSK #interface #performance
On the Performance of the POSIX I/O Interface to PVFS (MV, RBR, PHC, RT, AS, MTK), pp. 332–339.
DATEDATE-2005-HabibiAMT04 #design #interface #verification
On the Design and Verification Methodology of the Look-Aside Interface (AH, AIA, OAM, ST), pp. 290–295.
FoSSaCSFoSSaCS-2004-BozgaEL #effectiveness #encryption #protocol
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols (LB, CE, YL), pp. 42–57.
FoSSaCSFoSSaCS-2004-FokkinkN #finite #infinity
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.
FoSSaCSFoSSaCS-2004-GiambiagiSV #behaviour #calculus #infinity #process
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi (PG, GS, FDV), pp. 226–240.
FoSSaCSFoSSaCS-2004-MalerP
On Recognizable Timed Languages (OM, AP), pp. 348–362.
FoSSaCSFoSSaCS-2004-Meyer #term rewriting
On Term Rewriting Systems Having a Rational Derivation (AM), pp. 378–392.
STOCSTOC-2004-AlbersS #algorithm #performance
On the performance of greedy algorithms in packet buffering (SA, MS), pp. 35–44.
STOCSTOC-2004-Feige #bound #graph #independence #random
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.
STOCSTOC-2004-Har-PeledM #clustering
On coresets for k-means and k-median clustering (SHP, SM), pp. 291–300.
CSLCSL-2004-ChatterjeeMJ #game studies #nash #probability
On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.
CSLCSL-2004-Schubert
On the Building of Affine Retractions (AS), pp. 205–219.
CSLCSL-2004-StrassburgerL #linear #logic #multi #proving
On Proof Nets for Multiplicative Linear Logic with Units (LS, FL), pp. 145–159.
ICLPICLP-2004-LinkeTW #logic programming #source code
On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
ICLPICLP-2004-MonfroySL #constraints
On Hybridization of Local Search and Constraint Propagation (EM, FS, TL), pp. 299–313.
ICLPICLP-2004-NieuwenborghHV #multi #order #source code
On Programs with Linearly Ordered Multiple Preferences (DVN, SH, DV), pp. 180–194.
LICSLICS-2004-FuhrmannP #geometry #interactive #logic
On the Geometry of Interaction for Classical Logic (CF, DJP), pp. 211–220.
LICSLICS-2004-Klaedtke #automaton
On the Automata Size for Presburger Arithmetic (FK), pp. 110–119.
LICSLICS-2004-OuaknineW #automaton #decidability #problem
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.
ICTSSTestCom-2004-HuoP #testing
On Testing Partially Specified IOTS through Lossless Queues (JH, AP), pp. 76–94.
VMCAIVMCAI-2004-Sagiv #abstraction #canonical #power of
On the Expressive Power of Canonical Abstraction (SS), p. 58.
ICDARICDAR-2003-GarainC #comprehension #online
On Machine Understanding of Online Handwritten Mathematical Expressions (UG, BBC), pp. 349–353.
JCDLJCDL-2003-LiuLNG #metadata #query
On Querying Geospatial and Georeferenced Metadata Resources in G-Portal (ZL, EPL, WKN, DHLG), pp. 245–255.
PODSPODS-2003-AggarwalA #nearest neighbour
On nearest neighbor indexing of nonlinear trajectories (CCA, DA), pp. 252–259.
PODSPODS-2003-CaliLR #complexity #consistency #database #decidability #query #semistructured data
On the decidability and complexity of query answering over inconsistent and incomplete databases (AC, DL, RR), pp. 260–271.
PODSPODS-2003-DittrichSTW
On producing join results early (JPD, BS, DST, PW), pp. 134–142.
SIGMODSIGMOD-2003-ChaudhuriKN #relational #sorting #xml
On Relational Support for XML Publishing: Beyond Sorting and Tagging (SC, RK, JFN), pp. 611–622.
SIGMODSIGMOD-2003-KangN
On Schema Matching with Opaque Column Names and Data Values (JK, JFN), pp. 205–216.
VLDBVLDB-2003-FlescaFM #query #xpath
On the minimization of Xpath queries (SF, FF, EM), pp. 153–164.
VLDBVLDB-2003-KumaranH #cost analysis #database #multi
On the Costs of Multilingualism in Database Systems (AK, JRH), pp. 105–116.
CSEETCSEET-2003-KorneckiKGK #industrial
On a Partnership between Software Industry and Academia (AJK, SK, DPG, NK), pp. 60–69.
ICSMEICSM-2003-SartipiK #architecture #graph #modelling
On Modeling Software Architecture Recovery as Graph Matching (KS, KK), pp. 224–234.
DLTDLT-2003-DAlessandroV
On Well Quasi-orders on Languages (FD, SV), pp. 230–241.
DLTDLT-2003-Domaratzki #automaton
On Enumeration of Müller Automata (MD), pp. 254–265.
DLTDLT-2003-FreundMOP
On Three Classes of Automata-Like P Systems (RF, CMV, AO, GP), pp. 292–303.
DLTDLT-2003-GomezP
On a Conjecture of Schnoebelen (ACG, JÉP), pp. 35–54.
DLTDLT-2003-HolzerK #automaton #finite #monad
On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
ICALPICALP-2003-BlomFN #axiom #simulation
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces (SB, WF, SN), pp. 109–118.
ICALPICALP-2003-CarayolC #infinity
On Equivalent Representations of Infinite Structures (AC, TC), pp. 599–610.
ICALPICALP-2003-Fotakis #online
On the Competitive Ratio for Online Facility Location (DF), pp. 637–652.
FMFME-2003-Randell #fault
On Failures and Faults (BR), pp. 18–39.
RTARTA-2003-SalvatiG #complexity #higher-order #linear #λ-calculus
On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
TLCATLCA-2003-Boudol #normalisation
On Strong Normalization in the Intersection Type Discipline (GB), pp. 60–74.
TLCATLCA-2003-LazicN #independence #semantics
On a Semantic Definition of Data Independence (RL, DN), pp. 226–240.
DiGRADiGRA-2003-Lammes #game studies
On the border: pleasure of exploration and colonial mastery in Civilization III play the world (SL).
AGTIVEAGTIVE-2003-SzubaOS #concept #design #graph
On Graphs in Conceptual Engineering Design (JS, AO, AS), pp. 75–89.
CAiSECAiSE-2003-Stojanovic #ontology #query #refinement
On the Query Refinement in the Ontology-Based Searching for Information (NS), pp. 324–339.
ICEISICEIS-v1-2003-AbelloRSODGS #object-oriented
On Operations to Conform Object-Oriented Schemas (AA, ER, FS, MO, CD, EG, JS), pp. 39–46.
ICEISICEIS-v2-2003-KeeniGS #learning #network #performance #using
On Fast Learning of Neural Networks Using Back Propagation (KK, KG, HS), pp. 266–271.
ICEISICEIS-v3-2003-Wegmann #architecture #enterprise
On the Systemic Enterprise Architecture Methodology (Seam) (AW), pp. 483–490.
ICEISICEIS-v4-2003-TyrvainenJS #case study #learning
On Estimating the Amount of Learning Materials a Case Study (PT, MJ, AS), pp. 127–135.
CIKMCIKM-2003-YangRK #complexity #web
On the complexity of schema inference from web pages in the presence of nullable data attributes (GY, IVR, MK), pp. 224–231.
ICMLICML-2003-CumbyR #kernel #learning #relational
On Kernel Methods for Relational Learning (CMC, DR), pp. 107–114.
ICMLICML-2003-SebbanJ #approach #grammar inference #semistructured data #statistics
On State Merging in Grammatical Inference: A Statistical Approach for Dealing with Noisy Data (MS, JCJ), pp. 688–695.
ICMLICML-2003-ZhangY #convergence
On the Convergence of Boosting Procedures (TZ, BY), pp. 904–911.
KDDKDD-2003-LiuLLY #query
On computing, storing and querying frequent patterns (GL, HL, WL, JXY), pp. 607–612.
KDDKDD-2003-WebbBN #detection #difference
On detecting differences between groups (GIW, SMB, DAN), pp. 256–265.
MLDMMLDM-2003-Scaringella #classification
On the Size of a Classification Tree (AS), pp. 65–72.
SEKESEKE-2003-BahetiWDC #identification #information management
On Identifying Deficiencies in a Knowledge Management System (PB, LAW, AD, AC), pp. 385–392.
SEKESEKE-2003-Schobel-Theuer
On Variants of Genericity (TST), pp. 359–365.
SIGIRSIGIR-2003-AslamS #effectiveness #retrieval
On the effectiveness of evaluating retrieval systems in the absence of relevance judgments (JAA, RS), pp. 361–362.
SIGIRSIGIR-2003-GirolamiK #equivalence
On an equivalence between PLSI and LDA (MG, AK), pp. 433–434.
UMLUML-2003-SteimannGM #modelling #object-oriented
On the Key Role of Compositioning Object-Oriented Modelling (FS, JG, TAM), pp. 106–120.
PPDPPPDP-2003-BanyasadC #functional #geometry
On translating geometric solids to functional expressions (OB, PTC), pp. 44–55.
PPDPPPDP-2003-GrecoZ #bound #datalog #performance #query
On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
REFSQREFSQ-J-2002-ZowghiG03 #consistency #correctness #evolution #requirements
On the interplay between consistency, completeness, and correctness in requirements evolution (DZ, VG), pp. 993–1009.
ASEASE-2003-AbergLSMM #aspect-oriented #automation #evolution #kernel #logic #using
On the automatic evolution of an OS kernel using temporal logic and AOP (RAÅ, JLL, MS, GM, AFLM), pp. 196–204.
ESEC-FSEESEC-FSE-2003-MullerP #agile #evaluation
On the economic evaluation of XP projects (MMM, FP), pp. 168–177.
ICSEICSE-2003-BarryKS #evolution
On the Uniformity of Software Evolution Patterns (EJB, CFK, SS), pp. 106–113.
ICSEICSE-2003-SimpsonMGDM #assessment #re-engineering
On The Supervision and Assessment Of Part-Time Postgraduate Software Engineering Projects (AS, AM, JG, JD, SM), pp. 628–633.
SACSAC-2003-Leon-RojasMM #fuzzy
On the Fuzzy Bayesian Inference of Population Annoyance Level Caused by Noise Exposure (JMLR, VM, MM), pp. 227–234.
SACSAC-2003-MeloM #composition #framework #java
On the Composition of Java Frameworks Control-flows (ACVdM, BMM), pp. 1099–1103.
SACSAC-2003-TavaresPMC
On the Influence of GVR in Vehicle Routing (JT, FBP, PM, EC), pp. 753–758.
SACSAC-2003-YuNPC #classification #testing #using
On the Use of the Classification-Tree Method by Beginning Software Testers (YTY, SPN, PLP, TYC), pp. 1123–1127.
GPCEGPCE-2003-WangM #staged
On Stage Ordering in Staged Computation (ZW, RRM), pp. 77–96.
DACDAC-2003-PomeranzR #detection #testing
On test data compression and n-detection test sets (IP, SMR), pp. 748–751.
DATEDATE-2003-PomeranzRK #detection #fault
On the Characterization of Hard-to-Detect Bridging Faults (IP, SMR, SK), pp. 11012–11019.
DATEDATE-2003-ZachariahCKT #fault #modelling
On Modeling Cross-Talk Faults (STZ, YSC, SK, CT), pp. 10490–10495.
LCTESLCTES-2003-SutterVBB #abstraction
On the side-effects of code abstraction (BDS, HV, BDB, KDB), pp. 244–253.
LCTESLCTES-2003-Wasowski #performance #synthesis
On efficient program synthesis from statecharts (AW), pp. 163–170.
PDPPDP-2003-AlmeidaGMRT #algorithm #clustering #predict
On the Prediction of Master-Slave algorithms over Heterogeneous Clusters (FA, DG, LMM, CR, JT), p. 433–?.
PDPPDP-2003-DAmoreGL #parallel
On the Parallelization of a Commercial PSE for Scientific Computing (LD, MRG, GL), pp. 441–448.
PDPPDP-2003-ProdanFGMFM #architecture #clustering #grid #parametricity #performance #using
On Using ZENTURIO for Performance and Parameter Studies on Cluster and Grid Architectures (RP, TF, MG, GM, FF, HM), pp. 185–192.
PDPPDP-2003-SeragiottoFGMM #automation #distributed #parallel #performance #problem #source code #using
On Using Aksum for Semi-Automatically Searching of Performance Problems in Parallel and Distributed Programs (CSJ, TF, MG, GM, HM), pp. 385–392.
ESOPESOP-2003-GiambiagiD #implementation #protocol #security
On the Secure Implementation of Security Protocols (PG, MD), pp. 144–158.
FoSSaCSFoSSaCS-2003-SprengerD #calculus #induction #proving #reasoning #μ-calculus
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
STOCSTOC-2003-BartalLMN #metric
On metric ramsey-type phenomena (YB, NL, MM, AN), pp. 463–472.
STOCSTOC-2003-BrodalF
On the limits of cache-obliviousness (GSB, RF), pp. 307–315.
STOCSTOC-2003-GilbertK #behaviour
On the fractal behavior of TCP (ACG, HJK), pp. 297–306.
STOCSTOC-2003-ItohTT #independence #permutation #strict
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions (TI, YT, JT), pp. 710–719.
STOCSTOC-2003-Rabinovich #metric
On average distortion of embedding metrics into the line and into L1 (YR), pp. 456–462.
STOCSTOC-2003-Ya #power of #quantum
On the power of quantum fingerprinting (ACCY), pp. 77–81.
TACASTACAS-2003-AbdeddaimAM #nondeterminism #scheduling
On Optimal Scheduling under Uncertainty (YA, EA, OM), pp. 240–253.
TACASTACAS-2003-HenzingerKM #calculus #μ-calculus
On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.
CSLCSL-2003-DantchevR #complexity
On Relativisation and Complexity Gap (SSD, SR), pp. 142–154.
CSLCSL-2003-Khoussainov #algebra #data type #specification
On Algebraic Specifications of Abstract Data Types (BK), pp. 299–313.
CSLCSL-2003-KolaitisP #complexity #game studies
On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.
FATESFATES-2003-SenG
On Checking Whether a Predicate Definitely Holds (AS, VKG), pp. 15–29.
ICLPICLP-2003-LopesCS
On Deterministic Computations in the Extended Andorra Model (RL, VSC, FMAS), pp. 407–421.
ICLPICLP-2003-WuPR #complexity #logic programming
On the Complexity of Dependent And-Parallelism in Logic Programming (YW, EP, DR), pp. 361–376.
LICSLICS-2003-KhoussainovRS #automation #partial order
On Automatic Partial Orders (BK, SR, FS), pp. 168–177.
LICSLICS-2003-Murawski #equivalence
On Program Equivalence in Languages with Ground-Type References (ASM), p. 108–?.
ICSTSAT-2003-BuningSZ #modelling #quantifier
On Boolean Models for Quantified Boolean Horn Formulas (HKB, KS, XZ), pp. 93–104.
ICSTSAT-2003-Parisi #approach #probability #problem #random #satisfiability
On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.
ICSTSAT-2003-Szeider #parametricity #satisfiability
On Fixed-Parameter Tractable Parameterizations of SAT (SS), pp. 188–202.
ICSTSAT-2003-Williams
On Computing k-CNF Formula Properties (RW), pp. 330–340.
VMCAIVMCAI-2003-GodefroidJ #modelling
On the Expressiveness of 3-Valued Models (PG, RJ), pp. 206–222.
TPDLECDL-2002-Ruthven #feedback #using
On the Use of Explanations as Mediating Device for Relevance Feedback (IR), pp. 338–345.
HTHT-2002-BernsteinMW #hypermedia
On writing sculptural Hypertext (MB, DEM, MJW), pp. 65–66.
HTHT-2002-FurutaU
On the characteristics of scholarly annotations (RF, EU), pp. 78–79.
HTHT-2002-RoureCMPW
On hyperstructure and musical structure (DDR, DC, DTM, KRP, MJW), pp. 95–104.
PODSPODS-2002-ArenasFL #consistency #specification #verification #xml
On Verifying Consistency of XML Specifications (MA, WF, LL), pp. 259–270.
PODSPODS-2002-BunemanKT
On Propagation of Deletions and Annotations Through Views (PB, SK, WCT), pp. 150–158.
PODSPODS-2002-ChatterjiEGY #approximate #complexity #optimisation #query
On the Complexity of Approximate Query Optimization (SC, SSKE, SG, MDY), pp. 282–292.
PODSPODS-2002-LechtenborgerV #relational
On the Computation of Relational View Complements (JL, GV), pp. 142–149.
PODSPODS-2002-MokhtarSI #query
On Moving Object Queries (HM, JS, OHI), pp. 188–198.
PODSPODS-2002-Neven #power of #query
On the Power of Walking for Querying Tree-Structured Data (FN), pp. 77–84.
ITiCSEITiCSE-2002-RatteC #collaboration #industrial #simulation #using #web
On using the web as a collaboration space in the context of an industrial simulation (SR, JC), pp. 141–145.
CSMRCSMR-2002-BoulychevKT #re-engineering
On Project-Specific Languages and Their Application in Reengineering (DYB, DVK, AAT), pp. 177–185.
CSMRCSMR-2002-TahvildariK #design pattern #quality #re-engineering
On the Role of Design Patterns in Quality-Driven Re-engineering (LT, KK), pp. 230–240.
IWPCIWPC-2002-SimHE #benchmark #c++ #metric #using
On Using a Benchmark to Evaluate C++ Extractors (SES, RCH, SME), pp. 114–123.
IWPCIWPC-2002-TilleyH #comprehension #industrial #tool support #visualisation
On Selecting Software Visualization Tools for Program Understanding in an Industrial Context (SRT, SH), pp. 285–288.
WCREWCRE-2002-RillingM #3d #analysis #source code #using #visual notation
On the Use of Metaballs to Visually Map Source Code Structures and Analysis Results onto 3D Space (JR, SPM), pp. 299–308.
CIAACIAA-2002-Bruggemann-KleinW #context-free grammar #parsing #predict
On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.
CIAACIAA-2002-HolubC #implementation
On the Implementation of Compact DAWG’s (JH, MC), pp. 289–294.
CIAACIAA-2002-Korner #automaton #finite
On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.
DLTDLT-2002-Adorna #nondeterminism
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities (HNA), pp. 152–161.
DLTDLT-2002-DassowNR #complexity
On the Descriptional Complexity of Some Variants of Lindenmayer Systems (JD, TYN, BR), pp. 128–139.
DLTDLT-2002-DoL #bound #product line
On a Family of Codes with Bounded Deciphering Delay (DLV, IL), pp. 369–380.
DLTDLT-2002-HolzerK02a #automaton #finite #monad
On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
DLTDLT-2002-Kaszonyi
On the Structure of Graphic DLI-Sets (LK), pp. 349–356.
ICALPICALP-2002-Colcombet #decidability #first-order #graph #product line #reachability
On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
ICALPICALP-2002-DuchM #data type #multi #orthogonal #performance
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures (AD, CM), pp. 514–524.
ICALPICALP-2002-EstebanGM #bound #complexity
On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.
ICALPICALP-2002-KuskeL #formal method #monad
On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
ICALPICALP-2002-Lombardy #automaton
On the Construction of Reversible Automata for Reversible Languages (SL), pp. 170–182.
FMFME-2002-GaravelH #evaluation #functional #performance #using #verification
On Combining Functional Verification and Performance Evaluation Using CADP (HG, HH), pp. 410–429.
FLOPSFLOPS-2002-Iranzo #correctness
On the Correctness of the Factoring Transformation (PJI), pp. 119–133.
FLOPSFLOPS-2002-Meer #algebra #consistency #constraints #source code
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints (KM), pp. 88–102.
CSCWCSCW-2002-McNeeACGLRKR #recommendation #research
On the recommending of citations for research papers (SMM, IA, DC, PG, SKL, AMR, JAK, JR), pp. 116–125.
CAiSECAiSE-2002-VassiliadisSS #logic #modelling #process
On the Logical Modeling of ETL Processes (PV, AS, SS), pp. 782–786.
EDOCEDOC-2002-MilosevicD #behaviour #contract #monitoring
On Expressing and Monitoring Behaviour in Contracts (ZM, RGD), pp. 3–14.
ICEISICEIS-2002-Dedene #design #programming
On the Use of Jackson Structured Programming (JSP) for the Structured Design of XSL Transformations (GD), pp. 743–751.
CIKMCIKM-2002-AljlaylF #approach #effectiveness #retrieval
On arabic search: improving the retrieval effectiveness via a light stemming approach (MA, OF), pp. 340–347.
CIKMCIKM-2002-ChenCA #biology #database #evaluation #performance #query
On the efficient evaluation of relaxed queries in biological databases (YC, DC, KA), pp. 227–236.
CIKMCIKM-2002-Frieder #information retrieval #scalability
On scalable information retrieval systems (OF), p. 1.
ICMLICML-2002-GargHR #bound
On generalization bounds, projection profile, and margin distribution (AG, SHP, DR), pp. 171–178.
ICMLICML-2002-PerkinsP #fixpoint
On the Existence of Fixed Points for Q-Learning and Sarsa in Partially Observable Domains (TJP, MDP), pp. 490–497.
ICPRICPR-v1-2002-DuchesneBBC #classification #image #using
On the Classification of Temporal Lobe Epilepsy Using MR Image Appearance (SD, NB, AB, DLC), pp. 520–523.
ICPRICPR-v1-2002-PangWZZ #automation #image #segmentation
On Automated Tongue Image Segmentation in Chinese Medicine (BP, KW, DZ, FZ), pp. 616–619.
ICPRICPR-v1-2002-YamNC #automation #identification
On the Relationship of Human Walking and Running: Automatic Person Identification by Gait (CYY, MSN, JNC), pp. 287–290.
ICPRICPR-v2-2002-BrandtHE #image
On the Alignment of Transmission Electron Microscope Images without Fiducial Markers (SSB, JH, PE), pp. 278–281.
ICPRICPR-v2-2002-ChenSLS
On the Preview of Digital Movies (LHC, CWS, HYML, ACCS), pp. 997–1002.
ICPRICPR-v2-2002-Gomez #component #detection
On Selecting Colour Components for Skin Detection (GG), pp. 961–964.
ICPRICPR-v2-2002-Maloof #analysis #machine learning #statistics #testing
On Machine Learning, ROC Analysis, and Statistical Tests of Significance (MAM), pp. 204–207.
ICPRICPR-v3-2002-BoomgaardW #analysis #equivalence #estimation #robust
On the Equivalence of Local-Mode Finding, Robust Estimation and Mean-Shift Analysis as Used in Early Vision Tasks (RvdB, JvdW), pp. 927–930.
ICPRICPR-v3-2002-CorreiaCS #performance #recognition
On the Performance of Wavelets for Handwritten Numerals Recognition (SENC, JMdC, RS), pp. 127–130.
ICPRICPR-v3-2002-SmolkaSPV #performance
On the Fast Modification of the Vector Median Filter (BS, MS, KNP, ANV), pp. 931–934.
KDDKDD-2002-Aggarwal #classification #effectiveness #string
On effective classification of strings with wavelets (CCA), pp. 163–172.
KDDKDD-2002-AntalGF #clustering #learning #network
On the potential of domain literature for clustering and Bayesian network learning (PA, PG, GF), pp. 405–414.
KDDKDD-2002-KeoghK #benchmark #data mining #empirical #metric #mining #overview
On the need for time series data mining benchmarks: a survey and empirical demonstration (EJK, SK), pp. 102–111.
KDDKDD-2002-WalterR #interactive #using #visualisation
On interactive visualization of high-dimensional data using the hyperbolic plane (JAW, HJR), pp. 123–132.
KRKR-2002-Cate #logic
On the Logic of d-separation (BtC), pp. 568–577.
KRKR-2002-DuboisFP
On the Limitations of Ordinal Approaches to Decision-making (DD, HF, PP), pp. 133–146.
KRKR-2002-GiacomoLLS #implementation #semantics
On the Semantics of Deliberation in IndiGolog: From Theory to Implementation (GDG, YL, HJL, SS), pp. 603–614.
KRKR-2002-KoniecznyP
On the Frontier between Arbitration and Majority (SK, RPP), pp. 109–120.
SEKESEKE-2002-Briand #information management #re-engineering
On the many ways software engineering can benefit from knowledge engineering (LCB), pp. 3–6.
SEKESEKE-2002-CanonicoDFRV #legacy #quality
On the introduction of quality of service awareness in legacy ditributed applications (RC, MD, BF, SPR, GV), pp. 659–664.
SEKESEKE-2002-Medvidovic #architecture #development #middleware
On the role of middleware in architecture-based software development (NM), pp. 299–306.
SEKESEKE-2002-MoroN #component #coordination #multi
On the event coordination in multi-component systems (GM, AN), pp. 315–322.
SPLCSPLC-2002-GeyerB #process #product line
On the Influence of Variabilities on the Application-Engineering Process of a Product Family (LG, MB), pp. 1–14.
UMLUML-2002-PllanaF #modelling #uml
On Customizing the UML for Modeling Performance-Oriented Applications (SP, TF), pp. 259–274.
ECOOPECOOP-2002-IgarashiV #parametricity #type system
On Variance-Based Subtyping for Parametric Types (AI, MV), pp. 441–469.
AdaEuropeAdaEurope-2002-Jazayeri #architecture #evolution
On Architectural Stability and Evolution (MJ), pp. 13–23.
PEPMASIA-PEPM-2002-AgerDR #partial evaluation #string
On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.
PPDPPPDP-2002-NielsenPV #concurrent #constraints #power of #programming language
On the expressive power of temporal concurrent constraint programming languages (MN, CP, FDV), pp. 156–167.
SASSAS-2002-SerebrenikS #float #logic programming #source code #termination
On Termination of Logic Programs with Floating Point Computations (AS, DDS), pp. 151–164.
RERE-2002-DulacVLS #requirements #specification #using #visualisation
On the Use of Visualization in Formal Requirements Specification (ND, TV, NGL, MADS), pp. 71–80.
ASEASE-2002-MaccariRM #automation
On CASE Tool Usage at Nokia (AM, CR, FM), pp. 59–68.
SACSAC-2002-BusiZ #transaction
On the serializability of transactions in shared dataspaces with temporary data (NB, GZ), pp. 359–366.
SACSAC-2002-Leopold #locality
On optimal temporal locality of stencil codes (CL), pp. 948–952.
DACDAC-2002-KannanBB #estimation #metric
On metrics for comparing routability estimation methods for FPGAs (PK, SB, DB), pp. 70–75.
DACDAC-2002-LinBP #2d #modelling
On the efficacy of simplified 2D on-chip inductance models (TL, MWB, LTP), pp. 757–762.
DACDAC-2002-PomeranzKR
On output response compression in the presence of unknown output values (IP, SK, SMR), pp. 255–258.
DATEDATE-2002-BeroulleBLN #using
On the Use of an Oscillation-Based Test Methodology for CMOS Micro-Electro-Mechanical Systems (VB, YB, LL, PN), p. 1120.
DATEDATE-2002-Man #complexity #integration
On Nanoscale Integration and Gigascale Complexity in the Post.Com World (HDM), p. 12.
HPDCHPDC-2002-KurzyniecSM #case study #component #distributed #framework #performance
On the Viability of Component Frameworks for High Performance Distributed Computing: A Case Study (DK, VSS, MM), pp. 275–283.
LCTESLCTES-SCOPES-2002-JhumkaHCS #consistency #design #embedded #execution
On systematic design of globally consistent executable assertions in embedded software (AJ, MH, VC, NS), pp. 75–84.
PDPPDP-2002-GutierrezPZ #clustering #parallel #performance #reduction
On Improving the Performance of Data Partitioning Oriented Parallel Irregular Reductions (EG, OGP, ELZ), p. 445–?.
PDPPDP-2002-LarreaFA02a #detection #implementation
On the Impossibility of Implementing Perpetual Failure Detectors in Partially Synchronous Systems (ML, AF, SA), p. 99–?.
FoSSaCSFoSSaCS-2002-BidoitH #concept #integration #reachability
On the Integration of Observability and Reachability Concepts (MB, RH), pp. 21–36.
FoSSaCSFoSSaCS-2002-BorealeG #calculus #composition #reasoning
On Compositional Reasoning in the Sπ-calculus (MB, DG), pp. 67–81.
FoSSaCSFoSSaCS-2002-Cirstea #algebra #logic #reachability #specification
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability (CC), pp. 82–97.
FoSSaCSFoSSaCS-2002-LaroussinieMS #model checking
On Model Checking Durational Kripke Structures (FL, NM, PS), pp. 264–279.
STOCSTOC-2002-Albers #online #random #scheduling
On randomized online scheduling (SA), pp. 134–143.
STOCSTOC-2002-AlbersFG #locality
On paging with locality of reference (SA, LMF, OG), pp. 258–267.
STOCSTOC-2002-DengPS #complexity
On the complexity of equilibria (XD, CHP, SS), pp. 67–71.
STOCSTOC-2002-HastadV #random
On the advantage over a random assignment (JH, SV), pp. 43–52.
STOCSTOC-2002-Khot02a #game studies #power of
On the power of unique 2-prover 1-round games (SK), pp. 767–775.
STOCSTOC-2002-LindellLR #authentication #composition
On the composition of authenticated byzantine agreement (YL, AL, TR), pp. 514–523.
STOCSTOC-2002-NayakS #communication #quantum
On communication over an entanglement-assisted quantum channel (AN, JS), pp. 698–704.
STOCSTOC-2002-Raz #complexity #matrix
On the complexity of matrix product (RR), pp. 144–151.
CAVCAV-2002-CousotC #abstraction #verification
On Abstraction in Software Verification (PC, RC), pp. 37–56.
CAVCAV-2002-HartongHB #model checking #modelling
On Discrete Modeling and Model Checking for Nonlinear Analog Systems (WH, LH, EB), pp. 401–413.
CSLCSL-2002-AehligJ #normalisation
On Continuous Normalization (KA, FJ), pp. 59–73.
CSLCSL-2002-AtseriasB #proving
On the Automatizability of Resolution and Related Propositional Proof Systems (AA, MLB), pp. 569–583.
CSLCSL-2002-BaazM
On Generalizations of Semi-terms of Particularly Simple Form (MB, GM), pp. 382–396.
CSLCSL-2002-BerwangerGL #calculus #μ-calculus
On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
ICLPICLP-2002-MakholmS
On Enabling the WAM with Region Support (HM, KFS), pp. 163–178.
ISSTAISSTA-2002-LatellaM #behaviour #consistency #diagrams #statechart #testing #uml
On testing and conformance relations for UML statechart diagrams behaviours (DL, MM), pp. 144–153.
LICSLICS-2002-Statman #calculus
On The λ Y Calculus (RS), pp. 159–166.
SATSAT-2002-EglyWP #problem
On deciding subsumption problems (UE, SW, RP), p. 36.
SATSAT-2002-MotterM #performance #proving #satisfiability
On proof systems behind efficient SAT solvers (DM, IM), p. 31.
WICSAWICSA-2001-GurpBS #product line #variability
On the Notion of Variability in Software Product Lines (JvG, JB, MS), pp. 45–54.
ICDARICDAR-2001-MartiB01a #modelling #recognition
On the Influence of Vocabulary Size and Language Models in Unconstrained Handwritten Text Recognition (UVM, HB), pp. 260–265.
PODSPODS-2001-Aggarwal #reduction #similarity
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search (CCA).
PODSPODS-2001-AgrawalA #algorithm #data mining #design #mining #privacy #quantifier
On the Design and Quantification of Privacy Preserving Data Mining Algorithms (DA, CCA).
PODSPODS-2001-CaiCKN #complexity
On the Complexity of Join Predicates (JyC, VTC, RK, JFN).
PODSPODS-2001-FanL #constraints #xml
On XML Integrity Constraints in the Presence of DTDs (WF, LL).
PODSPODS-2001-KhannaT #nondeterminism
On Computing Functions with Uncertainty (SK, WCT).
VLDBVLDB-2001-MarronL #xml
On Processing XML in LDAP (PJM, GL), pp. 601–610.
ITiCSEITiCSE-2001-Putnik #integration #learning
On integration of learning and technology (ZP), p. 185.
CIAACIAA-2001-MelicharS #automaton #finite
On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.
CIAACIAA-2001-Velinov #automaton #design #modelling
On the Software Design of Cellular Automata Simulators for Ecological Modeling (YV), pp. 261–262.
DLTDLT-2001-BeaudryHNO #product line
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy (MB, MH, GN, FO), pp. 340–348.
DLTDLT-2001-HromkovicS #automaton #power of #random
On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.
ICALPICALP-2001-BofillG
On the Completeness of Arbitrary Selection Strategies for Paramodulation (MB, GG), pp. 951–962.
ICALPICALP-2001-BorosEGKM #generative #integer #linear
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.
ICALPICALP-2001-FishkinJP #multi
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates (AVF, KJ, LP), pp. 875–886.
ICALPICALP-2001-GoldreichVW #interactive #proving
On Interactive Proofs with a Laconic Prover (OG, SPV, AW), pp. 334–345.
ICALPICALP-2001-Seiden #online #problem
On the Online Bin Packing Problem (SSS), pp. 237–248.
ICALPICALP-2001-Woeginger #constraints #precedence #scheduling
On the Approximability of Average Completion Time Scheduling under Precedence Constraints (GJW), pp. 887–897.
RTARTA-2001-Lohrey #automaton #complexity #parallel
On the Parallel Complexity of Tree Automata (ML), pp. 201–215.
RTARTA-2001-Raamsdonk #higher-order #termination
On Termination of Higher-Order Rewriting (FvR), pp. 261–275.
ICFPICFP-2001-WalkerW #linear
On Regions and Linear Types (DW, KW), pp. 181–192.
CHICHI-2001-LaiCGT #comprehension #speech #web
On the road and on the Web?: comprehension of synthetic and human speech while driving (JL, KC, PAG, OT), pp. 206–212.
VISSOFTSVIS-2001-EichelbergerG #java #source code #visualisation
On the Visualization of Java Programs (HE, JWvG), pp. 295–306.
ICMLICML-2001-JafariGGE #equilibrium #game studies #learning #nash
On No-Regret Learning, Fictitious Play, and Nash Equilibrium (AJ, AG, DG, GE), pp. 226–233.
LSOLSO-2001-FeldmannA #learning
On the Status of Learning Software Organizations in the Year 2001 (RLF, KDA), pp. 2–7.
MLDMMLDM-2001-Krawiec #comparison #learning #using #visual notation
On the Use of Pairwise Comparison of Hypotheses in Evolutionary Learning Applied to Learning from Visual Examples (KK), pp. 307–321.
SIGIRSIGIR-2001-BekkermanEWT #categorisation #clustering
On Feature Distributional Clustering for Text Categorization (RB, REY, YW, NT), pp. 146–153.
UMLUML-2001-AkehurstB #modelling #ocl #query #uml
On Querying UML Data Models with OCL (DHA, BB), pp. 91–103.
UMLUML-2001-Stevens #modelling
On Associations in the Unified Modelling Language (PS), pp. 361–375.
ECOOPECOOP-2001-HirzelDH #detection #garbage collection #liveness
On the Usefulness of Liveness for Garbage Collection and Leak Detection (MH, AD, ALH), pp. 181–206.
OOPSLAOOPSLA-2001-EugsterGD
On Objects and Events (PTE, RG, CHD), pp. 254–269.
TOOLSTOOLS-USA-2001-Li #data type
On ODMG Data Types (LL), pp. 219–228.
LOPSTRLOPSTR-2001-KakehiGF #deforestation #parametricity
On Deforesting Parameters of Accumulating Maps (KK, RG, YF), pp. 46–56.
PLDIPLDI-2001-GhiyaLS #ambiguity #analysis #c #memory management #points-to #source code
On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs (RG, DML, DCS), pp. 47–58.
ICSEICSE-2001-RaysideK #object-oriented #programming
On the Syllogistic Structure of Object-Oriented Programming (DR, KK), pp. 113–122.
SACSAC-2001-AngelopoulosYPL #detection #video
On motion and noise detection in digital video (AA, EAY, AP, TL), pp. 309–311.
SACSAC-2001-KallesK #design #game studies #learning #using #verification
On verifying game designs and playing strategies using reinforcement learning (DK, PK), pp. 6–11.
SACSAC-2001-ViroliMO #coordination #framework #ontology #paradigm
On observation as a coordination paradigm: an ontology and a formal framework (MV, GM, AO), pp. 166–175.
DACDAC-2001-FanLWC #2d #design
On Optimum Switch Box Designs for 2-D FPGAs (HF, JL, YLW, CCC), pp. 203–208.
DATEDATE-2001-Chen #grid #power management
On the impact of on-chip inductance on signal nets under the influence of power grid noise (TC), pp. 451–459.
DATEDATE-2001-ChiusanoCPW #set
On applying the set covering model to reseeding (SC, SDC, PP, HJW), pp. 156–161.
DATEDATE-2001-CornoRSV
On the test of microprocessor IP cores (FC, MSR, GS, MV), pp. 209–213.
DATEDATE-2001-KoranneG #analysis #automation #geometry #layout
On automatic analysis of geometrically proximate nets in VSLI layout (SK, OPG), p. 818.
DATEDATE-2001-TeicaRV #automation #design #using #verification
On the verification of synthesized designs using automatically generated transformational witnesses (ET, RR, RV), p. 798.
PDPPDP-2001-MoleroSSD #network
On the Impact of Message Packetization in Networks of Workstations with Irregular Topology (XM, FS, VS, JD), pp. 3–10.
PDPPDP-2001-SanchoRD #behaviour #distributed #using
On the Relative Behavior of Source and Distributed Routing in NOWs Using Up/Down Routing Schemes (JCS, AR, JD), pp. 11–18.
ESOPESOP-2001-Muller-OlmR #complexity #constant
On the Complexity of Constant Propagation (MMO, OR), pp. 190–205.
ESOPESOP-2001-Ranzato #model checking
On the Completeness of Model Checking (FR), pp. 137–154.
FASEFASE-2001-BordeleauC #design #state machine
On the Importance of Inter-scenario Relationships in Hierarchical State Machine Design (FB, JPC), pp. 156–170.
FASEFASE-2001-Stevens #case study #modelling
On Use Cases and Their Relationships in the Unified Modelling Language (PS), pp. 140–155.
FoSSaCSFoSSaCS-2001-BidoitHK #reachability
On the Duality between Observability and Reachability (MB, RH, AK), pp. 72–87.
FoSSaCSFoSSaCS-2001-CalcagnoO #logic
On Garbage and Program Logic (CC, PWO), pp. 137–151.
FoSSaCSFoSSaCS-2001-DurandM #call-by #composition
On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.
FoSSaCSFoSSaCS-2001-KingKV #automaton #complexity #word
On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
FoSSaCSFoSSaCS-2001-Morin #sequence chart #traceability
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory (RM), pp. 332–346.
STOCSTOC-2001-FeigeS
On the integrality ratio of semidefinite relaxations of MAX CUT (UF, GS), pp. 433–442.
STOCSTOC-2001-Muller-OlmS #parallel #slicing #source code
On optimal slicing of parallel programs (MMO, HS), pp. 647–656.
STOCSTOC-2001-Pagh #complexity
On the cell probe complexity of membership and perfect hashing (RP), pp. 425–432.
CSLCSL-2001-BaazM #theorem
On a Generalisation of Herbrand’s Theorem (MB, GM), pp. 469–483.
ICLPICLP-2001-RochaSC
On a Tabling Engine That Can Exploit Or-Parallelism (RR, FMAS, VSC), pp. 43–58.
IJCARIJCAR-2001-BoigelotJW #automaton #integer #linear #using
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
IJCARIJCAR-2001-NieuwenhuisHRV #evaluation #proving #theorem proving
On the Evaluation of Indexing Techniques for Theorem Proving (RN, TH, AR, AV), pp. 257–271.
LICSLICS-2001-GodoyN #constraints #deduction #monad
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
LICSLICS-2001-HuuskonenH #logic #order
On Definability of Order in Logic with Choice (TH, TH), pp. 167–172.
LICSLICS-2001-SzwastT #problem #transitive
On the Decision Problem for the Guarded Fragment with Transitivity (WS, LT), pp. 147–156.
ICSTSAT-2001-Kullmann #satisfiability #using
On the use of autarkies for satisfiability decision (OK), pp. 231–253.
ADLADL-2000-Bohm #xml
On Extending the XML Engine with Query-Processing Capabilities (KB), pp. 127–138.
PODSPODS-2000-GrumbachT
On the Content of Materialized Aggregate Views (SG, LT), pp. 47–57.
PODSPODS-2000-LechtenborgerV #semantics #transaction
On Herbrand Semantics and Conflict Serializability of Read-Write Transactions (JL, GV), pp. 187–194.
SIGMODSIGMOD-2000-ChristophidesCS #integration #performance #query #xml
On Wrapping Query Languages and Efficient XML Integration (VC, SC, JS), pp. 141–152.
SIGMODSIGMOD-2000-JagadishKS #effectiveness #multi #string
On Effective Multi-Dimensional Indexing for Strings (HVJ, NK, DS), pp. 403–414.
IWPCIWPC-2000-TzerposH #algorithm #clustering
On the Stability of Software Clustering Algorithms (VT, RCH), pp. 211–218.
ICALPICALP-2000-BaierHHK #logic
On the Logical Characterisation of Performability Properties (CB, BRH, HH, JPK), pp. 780–792.
ICALPICALP-2000-BournezM #representation
On the Representation of Timed Polyhedra (OB, OM), pp. 793–807.
ICALPICALP-2000-HenriksenMKT #graph #sequence
On Message Sequence Graphs and Finitely Generated Regular MSC Languages (JGH, MM, KNK, PST), pp. 675–686.
ICALPICALP-2000-KarhumakiP #finite #set
On the Centralizer of a Finite Set (JK, IP), pp. 536–546.
ICALPICALP-2000-Mayr #bisimulation #complexity #parallel #problem #process
On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.
ICALPICALP-2000-NevenS #automaton #power of
On the Power of Tree-Walking Automata (FN, TS), pp. 547–560.
ICALPICALP-2000-Urbanski #automaton
On Deciding if Deterministic Rabin Language Is in Büchi Class (TFU), pp. 663–674.
WLCWLC-2000-AtanasiuMM
On the Sentence Valuations in a Semiring (AA, CMV, VM), pp. 22–39.
WLCWLC-2000-Dassow #difference #generative
On the Differentiation Function of some Language Generating Devices (JD), pp. 151–161.
WLCWLC-2000-ImrehIP #automaton #commutative
On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.
WLCWLC-2000-LombardyS
On the Star Height of Rational Languages: A New Presentation for Two Old Results (SL, JS), pp. 266–285.
WLCWLC-2000-Van
On A Class of Hypercodes (DLV), pp. 171–182.
RTARTA-2000-Statman #combinator #problem #word
On the Word Problem for Combinators (RS), pp. 203–213.
CAiSECAiSE-2000-KiepuszewskiHB #modelling #workflow
On Structured Workflow Modelling (BK, AHMtH, CB), pp. 431–445.
ICEISICEIS-2000-KuzniarzP #design #multi #object-oriented
On Designing Object Oriented Model for Multimedia Data (LK, MP), pp. 299–303.
ICEISICEIS-2000-Laleau #database #formal method #specification #uml
On the Interest of Combining UML with the B Formal Method for the Specification of Database Applications (RL), pp. 56–63.
ICEISICEIS-2000-NeiraABG #adaptation #fuzzy #logic #testing
On Adaptive Testing with Fuzzy Logic (ÁN, AA, JALB, VGG), pp. 186–190.
CIKMCIKM-2000-BellatrecheKS #performance
On Efficient Storage Space Distribution Among Materialized Views and Indices in Data Warehousing Environments (LB, KK, MS), pp. 397–404.
CIKMCIKM-2000-SadriB #database #equivalence #nondeterminism #query
On Equivalence of Queries in Uncertain Databases (FS, MFB), pp. 264–271.
ICPRICPR-v1-2000-AggarwalA #generative #scalability
On Generating Seamless Mosaics with Large Depth of Field (MA, NA), pp. 1588–1591.
ICPRICPR-v1-2000-Boujemaa #clustering
On Competitive Unsupervised Clustering (NB), pp. 1631–1634.
ICPRICPR-v2-2000-AmengualV #estimation #parametricity
On the Estimation of Error-Correcting Parameters (JCA, EV), pp. 2883–2886.
ICPRICPR-v2-2000-Figueiredo #approximate #learning
On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies (MATF), pp. 2618–2621.
ICPRICPR-v2-2000-GaoD #algorithm #classification #feature model
On Improvement of Feature Extraction Algorithms for Discriminative Pattern Classification (JG, XD), pp. 2101–2104.
ICPRICPR-v2-2000-JuanV #classification #edit distance #normalisation #performance #string #using
On the Use of Normalized Edit Distances and an Efficient k-NN Search Technique (k-AESA) for Fast and Accurate String Classification (AJ, EV), pp. 2676–2679.
ICPRICPR-v2-2000-MugurelVW #incremental #learning #multi #recognition
On the Incremental Learning and Recognition of the Pattern of Movement of Multiple Labeled Objects in Dynamic Scenes (ML, SV, GAWW), pp. 2652–2655.
ICPRICPR-v3-2000-BrucksteinHN #artificial reality #image
On Holographic Transform Compression of Images (AMB, RJH, ANN), pp. 3236–3241.
ICPRICPR-v3-2000-ChantlerM #classification #invariant #using
On the Use of Gradient Space Eigenvalues for Rotation Invariant Texture Classification (MJC, GM), pp. 3943–3946.
ICPRICPR-v3-2000-Ghosal #algebra
On Algebraic Smoothing: Theory and Results (SG), pp. 3021–3024.
ICPRICPR-v3-2000-MullerH #image #invariant #using
On the Use of SDF-Type Filters for Distortion Invariant Image Location (NM, BMH), pp. 3530–3533.
ICPRICPR-v4-2000-SerratLL
On Ridges and Valleys (JS, AML, DL), pp. 4059–4066.
KDDKDD-2000-Papadimitriou #data mining #mining
On certain rigorous approaches to data mining (CHP), p. 2.
KRKR-2000-Konieczny #difference #knowledge base
On the Difference between Merging Knowledge Bases and Combining them (SK), pp. 135–144.
KRKR-2000-Lin
On Strongest Necessary and Weakest Sufficient Conditions (FL), pp. 167–175.
KRKR-2000-MorrisM #complexity #reasoning
On the complexity of reasoning about repeating events (RAM, PHM), pp. 580–588.
SIGIRSIGIR-2000-McCabeLCGF #approach #design #evaluation #information retrieval #multi
On the design and evaluation of a multi-dimensional approach to information retrieval (MCM, JL, AC, DAG, OF), pp. 363–365.
UMLUML-2000-AmyotM #case study #concept #uml
On the Extension of UML with Use Case Maps Concepts (DA, GM), pp. 16–31.
ECOOPECOOP-2000-IgarashiP
On Inner Classes (AI, BCP), pp. 129–153.
TOOLSTOOLS-PACIFIC-2000-Diskin #modelling
On Mathematical Foundations for Business Modeling (Presented at TOOLS-USA 2000) (ZD), pp. 182–189.
TOOLSTOOLS-USA-2000-HarelK #behaviour #inheritance
On the Behavioral Inheritance of State-Based Objects (DH, OK), pp. 83–94.
AdaEuropeAdaEurope-2000-ChenL #set
On the Minimal Essential Subsets and Minimal Representative Sets (TYC, MFL), pp. 291–301.
AdaEuropeAdaEurope-2000-KienzleR #ada #persistent #reliability #streaming
On Persistent and Reliable Streaming in Ada (JK, ABR), pp. 82–95.
GPCEGCSE-2000-Rashid #persistent
On to Aspect Persistence (AR), pp. 26–36.
LOPSTRLOPSTR-2000-PierroW #abstract interpretation #precise
On the precision of abstract interpretations (ADP, HW).
PEPMPEPM-2000-Pfenning #logic #staged
On the Logical Foundations of Staged Computation (FP), p. 33.
PLDIPLDI-2000-Ramalingam
On loops, dominators, and dominance frontier (GR), pp. 233–241.
POPLPOPL-2000-MuthD #analysis #complexity #data flow
On the Complexity of Flow-Sensitive Dataflow Analyses (RM, SKD), pp. 67–80.
GPCESAIG-2000-Makholm
On Jones-Optimal Specialization for Strongly Typed Languages (HM), pp. 129–148.
REICRE-2000-GullaB #challenge #modelling #re-engineering #scalability
On the Challenges of Business Modeling in Large-Scale Reengineering Projects (JAG, TB), pp. 17–26.
FSEFSE-2000-BernardoCD #algebra #architecture #formal method #process
On the formalization of architectural types with process algebras (MB, PC, LD), pp. 140–148.
SACSAC-2000-CottaT #heuristic #representation
On the Influence of the Representation Granularity in Heuristic Forma Recombination (CC, JMT), pp. 433–439.
DACDAC-2000-KahngMS #analysis
On switch factor based analysis of coupled RC interconnects (ABK, SM, ES), pp. 79–84.
DACDAC-2000-NarasimhanR #bound #problem #scheduling #synthesis
On lower bounds for scheduling problems in high-level synthesis (MN, JR), pp. 546–551.
DACDAC-2000-PomeranzR #fault
On diagnosis of pattern-dependent delay faults (IP, SMR), pp. 59–62.
DATEDATE-2000-KimWSS #fault #incremental #satisfiability #testing
On Applying Incremental Satisfiability to Delay Fault Testing (JK, JW, KAS, JPMS), pp. 380–384.
DATEDATE-2000-ManquinhoS #algorithm #satisfiability #using
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms (VMM, JPMS), pp. 356–363.
DATEDATE-2000-SchollB #generative #logic #multi
On the Generation of Multiplexer Circuits for Pass Transistor Logic (CS, BB), pp. 372–378.
HPCAHPCA-2000-JimenezLF #automation #performance
On the Performance of Hand vs. Automatically Optimized Numerical Codes (MJ, JML, AF), pp. 183–194.
ISMMISMM-2000-HirzelD #garbage collection
On the Type Accuracy of Garbage Collection (MH, AD), pp. 1–11.
ISMMISMM-2000-ShahamKS #effectiveness #garbage collection #java
On the Effectiveness of GC in Java (RS, EKK, SS), pp. 12–17.
ISMMISMM-2000-StefanovicMB #modelling
On Models for Object Lifetimes (DS, KSM, JEBM), pp. 137–142.
ESOPESOP-2000-BusiZ #coordination #data-driven
On the Expressiveness of Event Notification in Data-Driven Coordination Languages (NB, GZ), pp. 41–55.
ESOPESOP-2000-Muller-OlmW #finite
On the Translation of Procedures to Finite Machines (MMO, AW), pp. 290–304.
ESOPESOP-2000-Thielecke #continuation #exception
On Exceptions Versus Continuations in the Presence of State (HT), pp. 397–411.
FoSSaCSFoSSaCS-2000-Caucal #term rewriting #word
On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.
FoSSaCSFoSSaCS-2000-HussonM
On Recognizable Stable Trace Languages (JFH, RM), pp. 177–191.
FoSSaCSFoSSaCS-2000-Morvan #graph
On Rational Graphs (CM), pp. 252–266.
FoSSaCSFoSSaCS-2000-QuagliaW #mobile #process
On Synchronous and Asynchronous Mobile Processes (PQ, DW), pp. 283–296.
FoSSaCSFoSSaCS-2000-YangR #calculus #refinement #semantics
On the Semantics of Refinement Calculi (HY, USR), pp. 359–374.
STOCSTOC-2000-CramerDD #complexity #multi
On the complexity of verifiable secret sharing and multiparty computation (RC, ID, SD), pp. 325–334.
STOCSTOC-2000-CrescenzoSY #proving
On zero-knowledge proofs (extended abstract): “from membership to decision” (GDC, KS, MY), pp. 255–264.
STOCSTOC-2000-CsirikJKOSW #algorithm
On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
STOCSTOC-2000-KatzT #performance
On the efficiency of local decoding procedures for error-correcting codes (JK, LT), pp. 80–86.
STOCSTOC-2000-Klauck #communication #probability #protocol #quantum
On quantum and probabilistic communication: Las Vegas and one-way protocols (HK), pp. 644–651.
STOCSTOC-2000-MotwaniPSV #decidability #problem
On the decidability of accessibility problems (RM, RP, VAS, SV), pp. 306–315.
STOCSTOC-2000-PapadimitriouV #problem
On the approximability of the traveling salesman problem (CHP, SV), pp. 126–133.
STOCSTOC-2000-Vadhan #complexity #interactive #proving
On transformation of interactive proofs that preserve the prover’s complexity (SPV), pp. 200–207.
STOCSTOC-2000-Vygen #algorithm
On dual minimum cost flow algorithms (JV), pp. 117–125.
TACASTACAS-2000-BornotGS
On the Construction of Live Timed Systems (SB, GG, JS), pp. 109–126.
TACASTACAS-2000-LarssonPY #model checking #problem #traversal
On Memory-Block Traversal Problems in Model-Checking Timed-Systems (FL, PP, WY), pp. 127–141.
TACASTACAS-2000-WolperB #automaton #constraints #linear
On the Construction of Automata from Linear Arithmetic Constraints (PW, BB), pp. 1–19.
CADECADE-2000-Sofronie-Stokkermans #unification
On Unification for Bonded Distributive Lattices (VSS), pp. 465–481.
CAVCAV-2000-NamjoshiT #composition #reasoning
On the Competeness of Compositional Reasoning (KSN, RJT), pp. 139–153.
ICLPCL-2000-BonchiGP #database #logic #verification
On Verification in Logic Database Languages (FB, FG, DP), pp. 957–971.
ICLPCL-2000-DekhtyarDD #complexity #constraints
On Complexity of Updates through Integrity Constraints (MID, AJD, SD), pp. 867–881.
ICLPCL-2000-LoncT #problem #semantics
On the Problem of Computing the Well-Founded Semantics (ZL, MT), pp. 673–687.
ICLPCL-2000-Pliuskevicius #deduction #strict
On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.
ICLPCL-2000-Wood #equivalence #xml
On the Equivalence of XML Patterns (PTW), pp. 1152–1166.
CSLCSL-2000-Kuznets #complexity #logic
On the Complexity of Explicit Modal Logics (RK), pp. 371–383.
CSLCSL-2000-MakowskyM #combinator #complexity #generative #graph
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale (JAM, KM), pp. 399–410.
CSLCSL-2000-Parigot
On the Computational Interpretation of Negation (MP), pp. 472–484.
CSLCSL-2000-Yavorsky #logic #proving #standard
On the Logic of the Standard Proof Predicate (REY), pp. 527–541.
ISSTAISSTA-2000-Hamlet #component #testing
On subdomains: Testing, profiles, and components (RGH), pp. 71–76.
LICSLICS-2000-GroheS #first-order #query
On First-Order Topological Queries (MG, LS), pp. 349–360.
ICTSSTestCom-2000-GrabowskiWWH #design #testing
On the Design of the New Testing Language TTCN-3 (JG, AW, CW, DH), pp. 161–176.
ICDARICDAR-1999-BansalS #how #recognition
On How to Describe Shapes of Devanagari Characters and Use Them for Recognition (VB, RMKS), pp. 410–413.
ICDARICDAR-1999-JunkerDH #analysis #component #documentation #evaluation #precise
On the Evaluation of Document Analysis Components by Recall, Precision, and Accuracy (MJ, AD, RH), pp. 713–716.
ICDARICDAR-1999-KiseMYM #automation #documentation #generative #hypermedia #keyword #using
On the Use of Density Distribution of Keywords for Automated Generation of Hypertext Links from Arbitrary Parts of Documents (KK, HM, MY, KM), pp. 301–304.
ICDARICDAR-1999-StuckelbergD #probability #reasoning #recognition #using
On Musical Score Recognition using Probabilistic Reasoning (MVS, DSD), pp. 115–118.
PODSPODS-1999-Abiteboul #xml
On Views and XML (SA), pp. 1–9.
PODSPODS-1999-ArgeSV #2d
On Two-Dimensional Indexability and Optimal Range Search Indexing (LA, VS, JSV), pp. 346–357.
PODSPODS-1999-KarloffM #complexity #problem
On the Complexity of the View-Selection Problem (HJK, MM), pp. 167–173.
PODSPODS-1999-KolliosGT #mobile
On Indexing Mobile Objects (GK, DG, VJT), pp. 261–272.
SIGMODSIGMOD-1999-ChaudhuriMN #random
On Random Sampling over Joins (SC, RM, VRN), pp. 263–274.
VLDBVLDB-1999-LakshmananSS #database #implementation #sql
On Efficiently Implementing SchemaSQL on an SQL Database System (LVSL, FS, SNS), pp. 471–482.
ITiCSEITiCSE-1999-Kumar #assessment #online #testing
On changing from written to on-line tests in Computer Science I: an assessment (ANK), pp. 25–28.
ITiCSEITiCSE-1999-LomicP #distance #education
On distance education courseware (ML, ZP), p. 194.
IWPCIWPC-1999-Li #evolution
On Managing Classes for Evolving Software (LL), pp. 144–150.
IWPCIWPC-1999-MayrhauserL #maintenance #static analysis
On the Role of Static Analysis during Software Maintenance (AvM, SL), pp. 170–177.
WCREWCRE-1999-Systa #java #modelling #reverse engineering
On the Relationships between Static and Dynamic Models in Reverse Engineering Java Software (TS), pp. 304–313.
DLTDLT-1999-AndreBC #bound #decidability #query
On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
DLTDLT-1999-BuchholzKK #automaton
On tally languages and generalized interacting automata (TB, AK, MK), pp. 316–325.
DLTDLT-1999-Holzer
On fixed and general membership for external and internal contextual languages (MH), pp. 351–361.
DLTDLT-1999-KarhumakiP #complexity #order #string
On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.
DLTDLT-1999-Petre
On semilinearity in formal power series (IP), pp. 220–231.
DLTDLT-1999-SalomaaY #composition #finite
On the decomposition of finite languages (AS, SY), pp. 22–31.
ICALPICALP-1999-BermanK
On Some Tighter Inapproximability Results (PB, MK), pp. 200–209.
ICALPICALP-1999-GuptaKS
On the Complements of Partial k-Trees (AG, DK, TCS), pp. 382–391.
ICALPICALP-1999-HromkovicS #automaton #finite #power of
On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.
ICALPICALP-1999-Umans #complexity #problem
On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.
FMFM-v1-1999-MandelC #ocl #power of
On the Expressive Power of OCL (LM, MVC), pp. 854–874.
FMFM-v2-1999-Muller-OlmW
On Excusable and Inexcusable Failures (MMO, AW), pp. 1107–1127.
IFMIFM-1999-BoltonDW #data type #process #refinement #simulation
On the Refinement and Simulation of Data Types and Processes (CB, JD, JW), pp. 273–292.
RTARTA-1999-Groote #deduction #normalisation
On the Strong Normalisation of Natural Deduction with Permutation-Conversions (PdG), pp. 45–59.
RTARTA-1999-Otto #formal method
On the Connections between Rewriting and Formal Language Theory (FO), pp. 332–355.
RTARTA-1999-SaubionS #implementation
On Implementation of Tree Synchronized Languages (FS, IS), pp. 382–396.
FLOPSFLOPS-1999-MarinIS #higher-order #lazy evaluation
On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.
FLOPSFLOPS-1999-Ohlebusch #term rewriting
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.
ICFPICFP-1999-LaunchburyLC #architecture #design #haskell
On Embedding a Microarchitectural Design Language within Haskell (JL, JRL, BC), pp. 60–69.
IFLIFL-1999-GrelckKS #code generation #multi
On Code Generation for Multi-generator WITH-Loops in SAC (CG, DK, SBS), pp. 77–94.
AGTIVEAGTIVE-1999-BottoniPS #representation
On a Uniform Representation of Transformation Systems (PB, FPP, MS), pp. 63–78.
HCIHCI-EI-1999-Haubner #image #quality #visual notation
On the Visual Quality of Still Images and of Low-motion Talking Head Digital Videos (PJH), pp. 471–475.
ICEISICEIS-1999-Baptista #multi
On Incorporating Multimedia into Spatio-Temporal Systems (CdSB), pp. 23–28.
ICMLICML-1999-GiordanaP #behaviour
On Some Misbehaviour of Back-Propagation with Non-Normalized RBFNs and a Solution (AG, RP), pp. 162–170.
KDDKDD-1999-AggarwalGY #categorisation #clustering
On the Merits of Building Categorization Systems by Supervised Clustering (CCA, SCG, PSY), pp. 352–356.
SEKESEKE-1999-Feldmann #repository #reuse
On Developing a Repository Structure Tailored for Reuse with Improvement (RLF), pp. 51–71.
TOOLSTOOLS-PACIFIC-1999-KollingR #similarity
On Creation, Equality and the Object Model (MK, JR), p. 210–?.
AdaEuropeAdaEurope-1999-Hagenauer #distributed #simulation #using
On the Use of Controlled Types for Fossil Collection in a Distributed Simulation Systems (HH), pp. 238–249.
LOPSTRLOPSTR-1999-FilipeLOY #aspect-oriented #component #development #framework #logic #object-oriented
On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic (JKF, KKL, MO, HY), pp. 42–61.
PLDIPLDI-1999-BlellochC #bound #garbage collection #multi
On Bounding Time and Space for Multiprocessor Garbage Collection (GEB, PC), pp. 104–117.
PPDPPPDP-1999-GoriL #finite #verification
On the Verification of Finite Failure (RG, GL), pp. 311–327.
PPDPPPDP-1999-KamareddineM #proving #recursion #termination
On Formalised Proofs of Termination of Recursive Functions (FK, FM), pp. 29–46.
SASSAS-1999-McAllester #analysis #complexity
On the Complexity Analysis of Static Analyses (DAM), pp. 312–329.
PLDIBest-of-PLDI-1999-BlellochC99a #bound #garbage collection #multi
On bounding time and space for multiprocessor garbage collection (with retrospective) (GEB, PC), pp. 626–641.
SACSAC-1999-Omicini #coordination #modelling #semantics
On the Semantics of Tuple-Based Coordination Models (AO), pp. 175–182.
DACDAC-1999-BanerjeeMSH
On Thermal Effects in Deep Sub-Micron VLSI Interconnects (KB, AM, ALSV, CH), pp. 885–891.
DACDAC-1999-KimHT #self #synthesis
On ILP Formulations for Built-In Self-Testable Data Path Synthesis (HBK, DSH, TT), pp. 742–747.
DATEDATE-1999-FavalliM #design #functional #self
On the Design of Self-Checking Functional Units Based on Shannon Circuits (MF, CM), pp. 368–375.
DATEDATE-1999-MurgaiF
On Reducing Transitions Through Data Modifications (RM, MF), p. 82–?.
DATEDATE-1999-NovakHK #analysis
On Analog Signature Analysis (FN, BH, SK), p. 249–?.
DATEDATE-1999-ZarrinehU #architecture #memory management #programmable
On Programmable Memory Built-In Self Test Architectures (KZ, SJU), pp. 708–713.
PDPPDP-1999-CortesRSPL #algorithm #nearest neighbour #parallel #performance
On the performance of nearest-neighbors load balancing algorithms in parallel systems (AC, AR, MÀS, PP, EL), pp. 170–177.
SOSPSOSP-1999-WolmanVSCKL #performance #web
On the scale and performance of cooperative Web proxy caching (AW, GMV, NS, NC, ARK, HML), pp. 16–31.
FASEFASE-1999-Muller-OlmSC #algebra #approach #component #evolution
On the Evolution of Reactive Components: A Process-Algebraic Approach (MMO, BS, RC), pp. 161–175.
STOCSTOC-1999-BlomerS #complexity #independence
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice (JB, JPS), pp. 711–720.
STOCSTOC-1999-CharikarKRRT #markov
On targeting Markov segments (MC, RK, PR, SR, AT), pp. 99–108.
STOCSTOC-1999-RazR #bound
On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.
STOCSTOC-1999-Rojas #complexity #geometry
On the Complexity of Diophantine Geometry in Low Dimensions (JMR), pp. 527–536.
TACASTACAS-1999-Hirschkoff #bisimulation #using #verification
On the Benefits of Using the Up-To Techniques for Bisimulation Verification (DH), pp. 285–299.
TACASTACAS-1999-RusuS #abstraction #proving #safety #static analysis #theorem proving
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction (VR, ES), pp. 178–192.
CADECADE-1999-Artemov #proving #theorem proving #verification
On Explicit Reflection in Theorem Proving and Formal Verification (SNA), pp. 267–281.
CADECADE-1999-Sofronie-Stokkermans #complexity #decidability
On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results (VSS), pp. 157–171.
CAVCAV-1999-BozgaM #representation
On the Representation of Probabilities over Structured Domains (MB, OM), pp. 261–273.
CSLCSL-1999-SeidlN #fixpoint
On Guarding Nested Fixpoints (HS, AN), pp. 484–498.
LICSLICS-1999-EsparzaFM #protocol #verification
On the Verification of Broadcast Protocols (JE, AF, RM), pp. 352–359.
LICSLICS-1999-Kozen #algebra #hoare #logic #testing
On Hoare Logic and Kleene Algebra with Tests (DK), pp. 167–172.
LICSLICS-1999-MollerR #power of
On the Expressive Power of CTL (FM, AMR), pp. 360–368.
LICSLICS-1999-Pym #logic
On Bunched Predicate Logic (DJP), pp. 183–192.
PODSPODS-1998-CalvaneseGL #constraints #decidability #query
On the Decidability of Query Containment under Constraints (DC, GDG, ML), pp. 149–158.
PODSPODS-1998-KolaitisMT #complexity #problem #query
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
SIGMODSIGMOD-1998-JaedickeM #parallel
On Parallel Processing of Aggregate and Scalar Functions in Object-Relational DBMS (MJ, BM), pp. 379–389.
VLDBVLDB-1998-GarciaLL
On Optimal Node Splitting for R-trees (YJG, MAL, STL), pp. 334–344.
VLDBVLDB-1998-RamaswamyMS
On the Discovery of Interesting Patterns in Association Rules (SR, SM, AS), pp. 368–379.
ITiCSEITiCSE-1998-DybdahlST #animation
On animation features of Excel (AD, ES, JT), pp. 77–80.
CSMRCSMR-1998-OhtaMI #source code #verification
On Constructing a Tool to Verify Programs for Processors Built in Machines (TO, NM, YI), pp. 52–59.
WCREWCRE-1998-Blaha #database #reverse engineering
On Reverse Engineering of Vendor Databases (MRB), pp. 183–190.
WCREWCRE-1998-ClaytonRW #information management
On the Knowledge Required to Understand a Program (RC, SR, LMW), pp. 69–78.
ICALPICALP-1998-AkutsuY #biology #complexity #problem
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology (TA, MY), pp. 832–843.
ICALPICALP-1998-BoigelotRW #automaton #integer
On the Expressiveness of Real and Integer Arithmetic Automata (BB, SR, PW), pp. 152–163.
ICALPICALP-1998-BorchertKS #first-order
On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.
ICALPICALP-1998-BuchsbaumGW #automaton #finite
On the Determinization of Weighted Finite Automata (ALB, RG, JW), pp. 482–493.
ICALPICALP-1998-DamicoMM #automaton
On Computing the Entropy of Cellular Automata (Md, GM, LM), pp. 470–481.
ICALPICALP-1998-JuknaZ #bound #branch #nondeterminism #source code
On Branching Programs With Bounded Uncertainty (SJ, SZ), pp. 259–270.
ICALPICALP-1998-Mellies #theorem
On a Duality Between Kruskal and Dershowitz Theorems (PAM), pp. 518–529.
ICALPICALP-1998-MerroS #calculus
On Asynchrony in Name-Passing Calculi (MM, DS), pp. 856–867.
CIAAWIA-1998-Blum #parsing
On Parsing LL-Languages (NB), pp. 13–21.
CIAAWIA-1998-Goeman #linear #lr #parsing #string
On Parsing and Condensing Substrings of LR Languages in Linear Time (HG), pp. 22–42.
CIAAWIA-1998-Velinov #graph #implementation #semantics #syntax
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment (YV), pp. 199–212.
RTARTA-1998-Schmidt-SchaussS #equation
On the Exponent of Periodicity of Minimal Solutions of Context Equation (MSS, KUS), pp. 61–75.
FLOPSFLOPS-1998-IshikawaWFMN #semantics
On the Semantics of GAEA (HI, TW, KF, JM, HN), pp. 123–142.
ICFPICFP-1998-MinamideG #complexity #runtime
On the Runtime Complexity of Type-Directed Unboxing (YM, JG), pp. 1–12.
ICFPICFP-1998-Putnik #education #self
On Application of Self-Similar Pictures in Education (ZP), p. 341.
IFLIFL-1998-McAdam #interface #unification
On the Unification of Substitutions in Type Interfaces (BJM), pp. 137–152.
ICMLICML-1998-Ng #feature model #learning
On Feature Selection: Learning with Exponentially Many Irrelevant Features as Training Examples (AYN), pp. 404–412.
ICMLICML-1998-NockJ #power of
On the Power of Decision Lists (RN, PJ), pp. 413–420.
ICPRICPR-1998-Chen #algorithm #image
On the selection of image compression algorithms (CCC), pp. 1500–1504.
ICPRICPR-1998-FiskerC #estimation #modelling #parametricity
On parameter estimation in deformable models (RF, JMC), pp. 762–766.
ICPRICPR-1998-Gimelfarb98a #image #modelling #random
On the maximum likelihood potential estimates for Gibbs random field image models (GLG), pp. 1598–1600.
ICPRICPR-1998-OkataniD #identification #invariant #problem #using
On identification of singular points using photometric invariants for global shape from shading problem (TO, KD), pp. 1787–1790.
ICPRICPR-1998-SattarT #approach #documentation #fuzzy #image #logic #multi #using
On the multiresolution enhancement of document images using fuzzy logic approach (FS, DBHT), pp. 939–941.
KDDKDD-1998-GraefeFC #classification #database #performance #scalability #sql #statistics
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases (GG, UMF, SC), pp. 204–208.
KRKR-1998-KoniecznyP #logic
On the Logic of Merging (SK, RPP), pp. 488–498.
KRKR-1998-Liberatore #reasoning
On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc (PL), pp. 144–155.
KRKR-1998-Lin #quality
On Measuring Plan Quality (FL), pp. 224–233.
KRKR-1998-WolterZ #decidability #logic
On the Decidability of Description Logics with Modal Operators (FW, MZ), pp. 512–523.
UMLUML-1998-Ou #constraints #database #design #diagrams #object-oriented #specification #uml #using
On Using UML Class Diagrams for Object-Oriented Database Design. Specification of Integrity Constraints (YO), pp. 173–188.
UMLUML-1998-Paech #development #diagrams #process #uml
On the Role of Activity Diagrams in UML — A User Task Centered Development Process for UML (BP), pp. 267–277.
ECOOPECOOP-1998-Liquori
On Object Extension (LL), pp. 498–522.
TOOLSTOOLS-ASIA-1998-DongDLL #communication #framework
On Open Communication Frameworks for Software Agents (HD, JD, XL, JL), pp. 188–195.
TOOLSTOOLS-ASIA-1998-SchulzGMZ #design pattern #object-oriented
On the Computer Aided Introduction of Design Pattern into Object-Oriented Systems (BS, TG, BM, WZ), pp. 258–267.
TOOLSTOOLS-USA-1998-LeontievOS #implementation #interface #representation
On Separation between Interface, Implementation, and Representation in Object DBMSs (YL, MTÖ, DS), pp. 155–167.
SASSAS-1998-HagiyaT #analysis #data flow #java #virtual machine
On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines (MH, AT), pp. 17–32.
SASSAS-1998-Leuschel #online #power of #termination
On the Power of Homeomorphic Embedding for Online Termination (ML), pp. 230–245.
REFSQREFSQ-1998-FabbriniFGGR #natural language #quality #requirements
On Linguistic Quality of Natural Language Requirements (FF, MF, VG, SG, SR), pp. 57–62.
ASEASE-1998-GoedickeMP #architecture #consistency #design #detection #evaluation #nondeterminism #performance
On Detecting and Handling Inconsistencies in Integrating Software Architecture Design and Performance Evaluation (MG, TM, CP), pp. 188–191.
SACSAC-1998-DamF #distributed #verification
On the verification of open distributed systems (MD, LÅF), pp. 532–540.
SACSAC-1998-DentiNO #coordination #power of #programming
On the expressive power of a language for programming coordination media (ED, AN, AO), pp. 169–177.
DATEDATE-1998-Cheng #multi
On Removing Multiple Redundancies in Combinational Circuits (DIC), pp. 738–742.
DATEDATE-1998-RibasC #equivalence #incremental #reuse #simulation #verification
On the Reuse of Symbolic Simulation Results for Incremental Equivalence Verification of Switch-Level Circuits (LR, JC), pp. 624–629.
HPDCHPDC-1998-KapadiaF #design
On the Design of a Demand-Based Network-Computing System: The Purdue University Network-Computing Hub (NHK, JABF), pp. 71–80.
HPDCHPDC-1998-Zambonelli #algorithm #distributed #effectiveness
On the Effectiveness of Distributed Checkpoint Algorithms for Domino-Free Recovery (FZ), pp. 124–131.
LCTESLCTES-1998-FerdinandW #behaviour #predict #realtime
On Predicting Data Cache Behavior for Real-Time Systems (CF, RW), pp. 16–30.
FoSSaCSFoSSaCS-1998-Matz
On Piecewise Testable, Starfree, and Recognizable Picture Languages (OM), pp. 203–210.
STOCSTOC-1998-Bartal #approximate #metric
On Approximating Arbitrary Metrices by Tree Metrics (YB), pp. 161–168.
STOCSTOC-1998-BeameKPS #complexity #proving #random #satisfiability
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
STOCSTOC-1998-CrescenziGPPY #complexity
On the Complexity of Protein Folding (PC, DG, CHP, AP, MY), pp. 597–603.
STOCSTOC-1998-GoldreichG #problem
On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.
STOCSTOC-1998-KhannaL
On Broadcast Disk Paging (SK, VL), pp. 634–643.
STOCSTOC-1998-KhannaZ
On Indexed Data Broadcast (SK, SZ), pp. 463–472.
STOCSTOC-1998-Thathachar #branch
On Separating the Read-k-Times Branching Program Hierarchy (JST), pp. 653–662.
CADECADE-1998-NonnengartRW #generative #normalisation
On Generating Small Clause Normal Forms (AN, GR, CW), pp. 397–411.
CADECADE-1998-OhtaIH #testing
On the Relationship Between Non-Horn Magic Sets and Relevancy Testing (YO, KI, RH), pp. 333–348.
CAVCAV-1998-Holzmann #model checking
On Checking Model Checkers (GJH), pp. 61–70.
CAVCAV-1998-Thathachar #order
On the Limitations of Ordered Representations of Functions (JST), pp. 232–243.
CSLCSL-1998-GiannottiMNP #database #effectiveness #logic #nondeterminism #semantics
On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases (FG, GM, MN, DP), pp. 58–72.
CSLCSL-1998-KempeS #algebra #first-order #power of #specification
On the Power of Quantifers in First-Order Algebraic Specification (DK, AS), pp. 45–57.
CSLCSL-1998-Pichler #complexity
On the Complexity of H-Subsumption (RP), pp. 355–371.
CSLCSL-1998-Sadowski #algorithm #satisfiability
On an Optimal Deterministic Algorithm for SAT (ZS), pp. 179–187.
ISSTAISSTA-1998-Ball #analysis #control flow #testing
On the Limit of Control Flow Analysis for Regression Test Selection (TB), pp. 134–142.
ISSTAISSTA-1998-Ntafos #random #testing
On Random and Partition Testing (SCN), pp. 42–48.
ICLPJICSLP-1998-DekhtyarDS
On Logically Justified Updates (MID, AJD, NS), pp. 250–264.
ICLPJICSLP-1998-DovierPRP #finite #representation #set
On the Representation and Management of Finite Sets in CLP Languages (AD, CP, GR, EP), pp. 40–54.
ICLPJICSLP-1998-RaoRR #scheduling
On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution (PR, CRR, IVR), pp. 310–324.
LICSLICS-1998-EmersonN #infinity #model checking #nondeterminism
On Model Checking for Non-Deterministic Infinite-State Systems (EAE, KSN), pp. 70–80.
LICSLICS-1998-JohannsenP #proving
On Proofs about Threshold Circuits and Counting Hierarchies (JJ, CP), pp. 444–452.
LICSLICS-1998-KolaitisO #bound #first-order #logic #problem
On the Boundedness Problem for Two-Variable First-Order Logic (PGK, MO), pp. 513–524.
LICSLICS-1998-Libkin #logic
On Counting Logics and Local Properties (LL), pp. 501–512.
ICDARICDAR-1997-KeeniSN #distributed #network #representation #using
On Distributed Representation of Output Layer for Recognizing Japanese Kana characters Using Neural Networks (KK, HS, KN), pp. 600–603.
ICDARICDAR-1997-MaergnerKP #analysis #benchmark #documentation #metric
On Benchmarking of Document Analysis Systems (VFM, PK, AKP), p. 331–?.
PODSPODS-1997-GuchtDGV #algebra #database #decidability #set
On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases (FD, MG, LV, DVG), pp. 68–77.
PODSPODS-1997-HellersteinKP #analysis
On the Analysis of Indexing Schemes (JMH, EK, CHP), pp. 249–256.
PODSPODS-1997-IbarraS #constraints #database #equivalence #linear #query
On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.
PODSPODS-1997-PapadimitriouY #complexity #database #query
On the Complexity of Database Queries (CHP, MY), pp. 12–19.
PODSPODS-1997-ScheufeleM #complexity #generative
On the Complexity of Generating Optimal Plans with Cross Products (WS, GM), pp. 238–248.
SIGMODSIGMOD-1997-CareyK #exclamation #sql
On Saying “Enough Already!” in SQL (MJC, DK), pp. 219–230.
WPCWPC-1997-TilleyS #framework #re-engineering #using #web
On Using the Web as Infrastructure for Reengineering (SRT, DBS), pp. 170–173.
DLTDLT-1997-BuchholzK #bound #power of
On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.
DLTDLT-1997-GecsegI #automaton #set
On complete sets of tree automata (FG, BI), pp. 37–47.
DLTDLT-1997-IkedaA #complexity
On the Complexity of Languages Definable by Hereditary Elementary Formal Systems (DI, HA), pp. 223–235.
DLTDLT-1997-LitovskyP
On a Binary Zigzag Operation (IL, BP), pp. 273–289.
ICALPICALP-1997-AspertiL #graph
On the Dynamics of Sharing Graphs (AA, CL), pp. 259–269.
ICALPICALP-1997-Cassaigne
On a Conjecture of J. Shallit (JC), pp. 693–704.
ICALPICALP-1997-CosmoG #composition #higher-order #λ-calculus
On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.
ICALPICALP-1997-DrosteG
On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.
ICALPICALP-1997-FrankelY #encryption
On Characterization of Escrow Encryption Schemes (YF, MY), pp. 705–715.
ICALPICALP-1997-PhilippouW #confluence #π-calculus
On Confluence in the π-Calculus (AP, DW), pp. 314–324.
ICALPICALP-1997-RitterP
On Explicit Substitution and Names (ER, VdP), pp. 248–258.
ICALPICALP-1997-Robson
On the Concentration of the Height of Binary Search Trees (JMR), pp. 441–448.
RTARTA-1997-Otto #string #term rewriting
On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.
RTARTA-1997-Struth #for free #problem #word
On the Word Problem for Free Lattices (GS), pp. 128–141.
ICFPICFP-1997-HeintzeM #analysis #complexity
On the Complexity of Set-Based Analysis (NH, DAM), pp. 150–163.
ICFPICFP-1997-LawallM #graph #reduction
On Global Dynamics of Optimal Graph Reduction (JLL, HGM), pp. 188–195.
ECIRACIR-1997-RobertsonG #information management #information retrieval
On the Marriage of Information Retrieval and Information Extraction (AMR, RJG).
CIKMCIKM-1997-AggarwalY #web
On Disk Caching of Web Objects in Proxy Servers (CCA, PSY), pp. 238–245.
ICMLICML-1997-Auer #approach #empirical #evaluation #learning #multi
On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach (PA), pp. 21–29.
ICMLICML-1997-MayorazM #composition
On the Decomposition of Polychotomies into Dichotomies (EM, MM), pp. 219–226.
SIGIRSIGIR-1997-RobertsonW
On Relevance Weights with Little Relevance Information (SER, SW), pp. 16–24.
UMLUML-1997-GogollaR #constraints #query #uml
On Constraints and Queries in UML (MG, MR), pp. 109–121.
UMLUML-1997-Ou #uml
On Mapping Between UML and Entity-Relationship Model (YO), pp. 45–57.
AdaEuropeAdaEurope-1997-RomanovskyMW #ada #programming
On Programming Atomic Actions in Ada 95 (ABR, SEM, AJW), pp. 254–265.
PPDPALP-1997-AotoT #composition #term rewriting
On Composable Properties of Term Rewriting Systems (TA, YT), pp. 114–128.
LOPSTRLOPSTR-1997-FlenerLO
On Correct Program Schemas (PF, KKL, MO), pp. 128–147.
PPDPPLILP-1997-CompagnoniF #algebra #calculus
On Object Calculus with Algebraic Rewriting (ABC, MF), pp. 17–31.
POPLPOPL-1997-Deutsch #analysis #complexity
On the Complexity of Escape Analysis (AD), pp. 358–371.
SASSAS-1997-CharlierF #abstract interpretation #theory and practice
On the Desirable Link Between Theory and Practice in Abstract Interpretation (BLC, PF), pp. 379–387.
SASSAS-1997-Ramalingam #evaluation
On Sparse Evaluation Representations (GR), pp. 1–15.
RERE-1997-BoisDZ #problem #using
On the Use of a Formal R. E. Language — The Generalized Railroad Crossing Problem (PDB, ED, JMZ), p. 128–?.
ASEASE-1997-MaharajB #refinement #specification #verification
On the Verification of VDM Specification and Refinement with PVS (SM, JB), p. 280–?.
ICSEICSE-1997-Botting
On the Economics of Mass-Marketed Software (RJB), pp. 465–470.
SACSAC-1997-Bosc #fuzzy
On the primitivity of the division of fuzzy relations (PB), pp. 197–201.
SACSAC-1997-FeinsilverGS #approach #polynomial
On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach (PF, UG, RS), pp. 537–539.
SACSAC-1997-LeongS #adaptation #database #mobile
On adaptive caching in mobile databases (HVL, AS), pp. 302–309.
SACSAC-1997-Li97b
On dynamic tree growing in hypercubes (KL), pp. 496–503.
SACSAC-1997-Sibai97a #communication #multi #pipes and filters
On the impact of pipelined communication in hierarchical ring multicomputers (FNS), pp. 384–388.
DATEEDTC-1997-DufazaZ #generative #pseudo #sequence #testing
On the generation of pseudo-deterministic two-patterns test sequence with LFSRs (CD, YZ), pp. 69–76.
DATEEDTC-1997-PomeranzR #generative #optimisation #search-based #testing
On improving genetic optimization based test generation (IP, SMR), pp. 506–511.
DATEEDTC-1997-PomeranzR97a #finite #state machine #testing
On the use of reset to increase the testability of interconnected finite-state machines (IP, SMR), pp. 554–559.
DATEEDTC-1997-RiescoDMCSJ #multi #network
On the way to the 2.5 Gbits/s ATM network ATM multiplexer demultiplexer ASIC (JR, JCD, LAM, JLC, CS, EJM), pp. 218–222.
HPCAHPCA-1997-QinB #communication #multi #performance
On the Use and Performance of Explicit Communication Primitives in Cache-Coherent Multiprocessor Systems (XQ, JLB), pp. 182–193.
PDPPDP-1997-MazzeoMV #distributed #evaluation #performance
On the evaluation of efficiency in heterogeneous distributed systems (AM, NM, UV), pp. 54–59.
PDPPDP-1997-MurphyV #performance
On the relative performance of diffusion and dimension exchange load balancing in hypercubes (TAM, JGV), pp. 29–34.
STOCSTOC-1997-ArgeFGV #memory management #sorting #string
On Sorting Strings in External Memory (LA, PF, RG, JSV), pp. 540–548.
STOCSTOC-1997-He #graph
On Floorplans of Planar Graphs (XH), pp. 426–435.
STOCSTOC-1997-MacielP #proving
On ACC0[pk] Frege Proofs (AM, TP), pp. 720–729.
STOCSTOC-1997-NaorR #permutation #pseudo #revisited
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (MN, OR), pp. 189–199.
TAPSOFTTAPSOFT-1997-MuthD #alias #analysis #complexity #pointer
On the Complexity of Function Pointer May-Alias Analysis (RM, SKD), pp. 381–392.
CADECADE-1997-NiehrenPR #constraints #finite #similarity #unification
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
CAVCAV-1997-YuanSAA #verification
On Combining Formal and Informal Verification (JY, JS, JAA, AA), pp. 376–387.
CSLCSL-1997-Pezzoli #complexity
On the Computational Complexity of Type 2 Functionals (EP), pp. 373–388.
ICLPILPS-1997-DixO #semantics
On Well-Behaved Semantics Suitable for Aggregation (JD, MO), p. 405.
ICLPILPS-1997-DovierFP #logic programming
On T Logic Programming (AD, AF, AP), pp. 323–337.
LICSLICS-1997-HeintzeM #analysis #polynomial #type system
On the Cubic Bottleneck in Subtyping and Flow Analysis (NH, DAM), pp. 342–351.
LICSLICS-1997-Kozen #algebra #complexity #reasoning
On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.
LICSLICS-1997-Libkin #finite #locality #modelling
On the Forms of Locality over Finite Models (LL), pp. 204–215.
PODSPODS-1996-BeeriMT #parametricity
On Genericity and Parametricity (CB, TM, PTS), pp. 104–116.
VLDBVLDB-1996-AgarwalADGNRS #multi
On the Computation of Multidimensional Aggregates (SA, RA, PD, AG, JFN, RR, SS), pp. 506–521.
WCREWCRE-1996-StoreyWFHHM #design #empirical #reverse engineering
On Designing an Experiment to Evaluate a Reverse Engineering Tool (MADS, KW, PF, DH, KH, HAM), p. 31–?.
WPCWPC-1996-MayrhauserV #comprehension #migration #scalability
On the Role of Hypotheses during Opportunistic Understanding While Porting Large Scale Code (AvM, AMV), pp. 68–77.
WPCWPC-1996-Wong #comprehension #process
On Inserting Program Understanding Technology into the Software Change Process (KW), pp. 90–99.
ICALPICALP-1996-AblayevK #branch #power of #random #source code
On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.
ICALPICALP-1996-AzarBFFLR
On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.
ICALPICALP-1996-BookVW #probability #quantifier
On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.
ICALPICALP-1996-Caucal #decidability #graph #infinity #monad
On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
ICALPICALP-1996-Julia
On ω-Generators and Codes (SJ), pp. 393–402.
ICALPICALP-1996-Luca #morphism #standard
On Standard Sturmian Morphisms (AdL), pp. 403–415.
ICALPICALP-1996-PatersonP #complexity #string
On the Complexity of String Folding (MP, TMP), pp. 658–669.
ICALPICALP-1996-ShuklaHRS #complexity #finite #problem #process #relational
On the Complexity of Relational Problems for Finite State Processes (SKS, HBHI, DJR, RES), pp. 466–477.
RTARTA-1996-Cosmo #diagrams #power of
On the Power of Simple Diagrams (RDC), pp. 200–214.
RTARTA-1996-Gramlich #proving #termination
On Proving Termination by Innermost Termination (BG), pp. 93–107.
RTARTA-1996-HillenbrandBF #performance #proving #theorem proving
On Gaining Efficiency in Completion-Based Theorem Proving (TH, AB, RF), pp. 432–435.
RTARTA-1996-Senizergues #problem #termination
On the Termination Problem for One-Rule Semi-Thue System (GS), pp. 302–316.
IFLIFL-1996-Scholz #array #functional #programming
On Programming Scientific Applications in SAC — A Functional Language Extended by a Subsystem for High-Level Array Operations (SBS), pp. 85–104.
CAiSECAiSE-1996-TryfonaS #database #modelling
On Information Modeling to Support Interoperable Spatial Databases (NT, JS), pp. 210–221.
CIKMCIKM-1996-AndrewsLSS #database #implementation #programming language
On Implementing SchemaLog — A Database Programming Language (AA, NS, LVSL, INS), pp. 309–316.
ICMLICML-1996-Lathrop
On the Learnability of the Uncomputable (RHL), pp. 302–309.
ICPRICPR-1996-ChenJ #behaviour #network
On the small sample behavior of the class-sensitive neural network (CHC, AJ), pp. 209–213.
ICPRICPR-1996-HoekstraD #classification
On the nonlinearity of pattern classifiers (AH, RPWD), pp. 271–275.
ICPRICPR-1996-Karasik #3d #commutative #representation #set
On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.
ICPRICPR-1996-KimuraWM #feature model #problem
On feature extraction for limited class problem (FK, TW, YM), pp. 191–194.
ICPRICPR-1996-Kupeev #algorithm #detection
On significant maxima detection: a fine-to-coarse algorithm (KYK), pp. 270–274.
ICPRICPR-1996-LanserZ #constraints #recognition #using
On the use of topological constraints within object recognition tasks (SL, CZ), pp. 580–584.
ICPRICPR-1996-PetrouS #fuzzy #network #reasoning
On the relationship between neural networks and fuzzy reasoning (MP, KRS), pp. 239–243.
ICPRICPR-1996-Polikarpova #analysis
On the fractal features in fingerprint analysis (NP), pp. 591–595.
ICPRICPR-1996-ScheundersHL #image
On the local optimality of image quantizers (PS, HVH, SL), pp. 664–668.
ICPRICPR-1996-Xia #invariant
On contour invariants: relationship and application (FX), pp. 136–140.
ICPRICPR-1996-YminA #multi #segmentation
On the segmentation of multi-font printed Uygur scripts (AY, YA), pp. 215–219.
ICPRICPR-1996-Zhang #geometry #image #lens
On the epipolar geometry between two images with lens distortion (ZZ), pp. 407–411.
ICPRICPR-1996-Zhang96a #parametricity
On the discretization of parameter domain in Hough transformation (MZ), pp. 527–531.
KRKR-1996-Ghallab #learning #online #recognition #representation
On Chronicles: Representation, On-line Recognition and Learning (MG), pp. 597–606.
KRKR-1996-KambhampatiY #constraints #refinement
On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning (SK, XY), pp. 135–146.
KRKR-1996-Tennenholtz #equilibrium #social
On Stable Social Laws and Qualitative Equilibrium for Risk-Averse Agents (MT), pp. 553–561.
SEKESEKE-1996-Gates #constraints
On Defining a Class of Integrity Constraints (AQG), pp. 338–344.
SIGIRSIGIR-1996-NieBR #retrieval
On Chinese Text Retrieval (JYN, MB, XR), pp. 225–233.
OOPSLAOOPSLA-1996-DickyDHL #automation
On Automatic Class Insertion with Overloading (HD, CD, MH, TL), pp. 251–267.
AdaEuropeAdaEurope-1996-ChenY #problem #testing
On Some Characterisation Problems of Subdomain Testing (TYC, YTY), pp. 147–158.
PPDPALP-1996-PierroD
On Negation As Instantiation (ADP, WD), pp. 32–46.
POPLPOPL-1996-Asperti #complexity
On the Complexity of β-Reduction (AA), pp. 110–118.
SACSAC-1996-RamamurthyYG #generative #parallel #scalability
On the scalability of parallel triplet generation for protein crystallography (SR, BWY, CG), pp. 344–352.
SACSAC-1996-WassermanYS #logic programming #metric
On quantitative measurement of negation in logic programming (HCW, KY, ZS), pp. 58–62.
DACDAC-1996-Coudert #problem
On Solving Covering Problems (OC), pp. 197–202.
DACDAC-1996-PomeranzR #sequence #testing
On Static Compaction of Test Sequences for Synchronous Sequential Circuits (IP, SMR), pp. 215–220.
HPCAHPCA-1996-QiaoM #multi #network #permutation
On the Multiplexing Degree Required to Embed Permutations in a Class of Networks with Direct Interconnects (CQ, YM), pp. 118–129.
TAPSOFTTAPSOFT-J-1995-HofmannS96 #abstraction #behaviour #higher-order #logic
On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic (MH, DS), pp. 3–45.
STOCSTOC-1996-Basu #algebra #bound #set
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets (SB), pp. 408–417.
STOCSTOC-1996-KearnsM #algorithm #learning #top-down
On the Boosting Ability of Top-Down Decision Tree Learning Algorithms (MJK, YM), pp. 459–468.
STOCSTOC-1996-Okamoto #proving #statistics
On Relationships between Statistical Zero-Knowledge Proofs (TO), pp. 649–658.
STOCSTOC-1996-Ta-Shma #random
On Extracting Randomness From Weak Random Sources (ATS), pp. 276–285.
CADECADE-1996-CyrlukLS
On Shostak’s Decision Procedure for Combinations of Theories (DC, PL, NS), pp. 463–477.
CADECADE-1996-EglyR #normalisation
On the Practical Value of Different Definitional Translations to Normal Form (UE, TR), pp. 403–417.
CSLCSL-1996-BartheM #algebra #reduction #type system
On the Subject Reduction Property for Algebraic Type Systems (GB, PAM), pp. 34–57.
CSLCSL-1996-Statman #monad
On Cartesian Monoids (RS), pp. 446–459.
LICSLICS-1996-BenediktL #constraints #query
On the Structure of Queries in Constraint Query Languages (MB, LL), pp. 25–34.
LICSLICS-1996-HillebrandK #power of #λ-calculus
On the Expressive Power of Simply Typed and Let-Polymorphic λ Calculi (GGH, PCK), pp. 253–263.
LICSLICS-1996-KolaitisV #logic #power of
On the Expressive Power of Variable-Confined Logics (PGK, MYV), pp. 348–359.
LICSLICS-1996-MarekNR #abduction #complexity
On the Complexity of Abduction (VWM, AN, JBR), pp. 513–522.
PODSPODS-1995-Vardi #bound #complexity #query
On the Complexity of Bounded-Variable Queries (MYV), pp. 266–276.
CSEETCSEE-1995-Shepard #education #validation #verification
On Teaching Software Verification and Validation (TS), pp. 375–385.
WCREWCRE-1995-Baker #scalability
On Finding Duplication and Near-Duplication in Large Software Systems (BSB), pp. 86–95.
DLTDLT-1995-Drewes
On the Connectedness of Pictures Defined by Iterated Function Systems (FD), pp. 289–298.
DLTDLT-1995-Gartner
On Partition Limited OL Systems (SG), pp. 230–236.
DLTDLT-1995-Holzer #automaton #finite
On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.
DLTDLT-1995-Hromkovic #communication #complexity #generative
On the Communication Complexity of Distributive Language Generation (JH), pp. 237–246.
DLTDLT-1995-Ilie
On Disjunctivity, Ultimate Periodicity and Ultimate Identity (LI), pp. 44–53.
DLTDLT-1995-Lepisto #complexity #infinity #word
On the Computational Complexity of Infinite Words (AL), pp. 350–359.
DLTDLT-1995-Lipponen #problem
On F-Prime Solutions of the Post Correspondence Problem (ML), pp. 139–147.
ICALPICALP-1995-Ambos-Spies #approximate #polynomial
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (KAS), pp. 384–392.
ICALPICALP-1995-BlundoSPV #random
On the Number of Random Bits in Totally Private Computation (CB, ADS, GP, UV), pp. 171–182.
ICALPICALP-1995-GiancarloG #algorithm #matrix
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
ICALPICALP-1995-Le #game studies
On Determining Optimal Strategies in Pursiut Games in the Plane (NML), pp. 499–510.
RTARTA-1995-Matiyasevich #logic
On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (YM), p. 1.
RTARTA-1995-Nieuwenhuis #constraints #proving
On Narrowing, Refutation Proofs and Constraints (RN), pp. 56–70.
TLCATLCA-1995-Padovani #equation #equivalence
On Equivalence Classes of Interpolation Equations (VP), pp. 335–349.
CIKMCIKM-1995-CorrelM #concurrent
On Isolation, Concurrency, and the Venus Rule Language (SC, DPM), pp. 281–289.
CIKMCIKM-1995-ManolopoulosNPV #generative #random
On the Generation of Aggregated Random Spatial Regions (YM, EN, GP, MV), pp. 318–325.
CIKMCIKM-1995-VilesF #information management #information retrieval
On the Update of Term Weights in Dynamic Information Retrieval Systems (CLV, JCF), pp. 167–174.
ICMLICML-1995-AlmuallimAK #learning
On Handling Tree-Structured Attributed in Decision Tree Learning (HA, YA, SK), pp. 12–20.
ICMLICML-1995-NockG #learning
On Learning Decision Committees (RN, OG), pp. 413–420.
ICMLICML-1995-OliverH
On Pruning and Averaging Decision Trees (JJO, DJH), pp. 430–437.
KDDKDD-1995-SilberschatzT #information management #metric
On Subjective Measures of Interestingness in Knowledge Discovery (AS, AT), pp. 275–281.
SEKESEKE-1995-PerkusichF #design #object-oriented
On the Object Oriented Design of a Track-Vehicle System (AP, JCAdF), pp. 283–290.
SIGIRSIGIR-1995-RaghavanS #query #reuse #using
On the Reuse of Past Optimal Queries (VVR, HS), pp. 344–350.
ECOOPECOOP-1995-AbadiC #type system
On Subtyping and Matching (MA, LC), pp. 145–167.
OOPSLAOOPSLA-1995-Malenfant #programming language #semantics
On the Semantic Diversity of Delegation-Based Programming Languages (JM), pp. 215–230.
LOPSTRLOPSTR-1995-Gluck #program transformation
On the Mechanics of Metasystem Hierarchies in Program Transformation (RG), pp. 234–251.
SACSAC-1995-ParkC #combinator #effectiveness #optimisation #search-based
On the effectiveness of genetic search in combinatorial optimization (KP, BC), pp. 329–336.
DACDAC-1995-El-MalehMRM #testing
On Test Set Preservation of Retimed Circuits (AHEM, TEM, JR, WM), pp. 176–182.
DACDAC-1995-HuangKT #bound #problem
On the Bounded-Skew Clock and Steiner Routing Problems (DJHH, ABK, CWAT), pp. 508–513.
DACDAC-1995-MakW #logic
On Optimal Board-Level Routing for FPGA-Based Logic Emulation (WKM, DFW), pp. 552–556.
DACDAC-1995-PomeranzR #logic
On Synthesis-for-Testability of Combinational Logic Circuits (IP, SMR), pp. 126–132.
PDPPDP-1995-WoolliscroftYATD #design #implementation
On the design and implementation of a dependable space instrument (LJCW, KHY, HSCA, JAT, CMD), pp. 366–373.
PDPPDP-1995-ZhouB #algorithm #implementation #parallel
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions (BBZ, RPB), pp. 401–408.
SOSPSOSP-1995-Liedtke #kernel
On micro-Kernel Construction (JL), pp. 237–250.
STOCSTOC-1995-BshoutyT #fourier
On the Fourier spectrum of monotone functions (NHB, CT), pp. 219–228.
STOCSTOC-1995-CuckerKKLW #turing machine
On real Turing machines that toss coins (FC, MK, PK, TL, KW), pp. 335–342.
STOCSTOC-1995-KremerNR #communication #complexity #random
On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
STOCSTOC-1995-MiltersenNSW #communication #complexity #data type #symmetry
On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
STOCSTOC-1995-NisanW #complexity #memory management
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern (NN, AW), pp. 723–732.
TACASTACAS-1995-BohnR #automation #communication #design #interactive
On Automatic and Interactive Design of Communication Systems (JB, SR), pp. 216–237.
TAPSOFTTAPSOFT-1995-HofmannS #abstraction #behaviour #higher-order #logic
On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic (MH0, DS), pp. 247–261.
TAPSOFTTAPSOFT-1995-Sassone #petri net
On the Category of Petri Net Computations (VS), pp. 334–348.
TAPSOFTTAPSOFT-1995-Wagner #algebra #graph grammar #power of
On the Expressive Power of Algebraic Graph Grammars with Application Conditions (AW), pp. 409–423.
CAVCAV-1995-EsparzaK #branch #logic #model checking #parallel #problem #process
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes (JE, AK), pp. 353–366.
CAVCAV-1995-Lescow #finite #game studies #source code
On Polynomial-Size Programs Winning Finite-State Games (HL), pp. 239–252.
ICLPICLP-1995-Hanus #equation #logic programming
On Extra Variables in (Equational) Logic Programming (MH), pp. 665–679.
ICLPICLP-1995-JacquetB #concurrent #logic #process
On Composing Concurrent Logic Processes (JMJ, KDB), pp. 531–545.
ICLPICLP-1995-MulkersSJB #equation
On the Practicality of Abstract Equation Systems (AM, WS, GJ, MB), pp. 781–795.
ICLPICLP-1995-YuanY #approach #logic programming
On Coherence Approach to Logic Program Revision (LYY, JHY), pp. 167–181.
LICSLICS-1995-BouajjaniEH #problem #process #verification
On the Verification Problem of Nonregular Properties for Nonregular Processes (AB, RE, PH), pp. 123–133.
LICSLICS-1995-Vardi #complexity #composition #model checking
On the Complexity of Modular Model Checking (MYV), pp. 101–111.
PODSPODS-1994-ChaudhuriV #complexity #datalog #equivalence #recursion #source code
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
PODSPODS-1994-HaasNS #estimation
On the Relative Cost of Sampling for Join Selectivity Estimation (PJH, JFN, ANS), pp. 14–24.
SIGMODSIGMOD-1994-HsiaoCY #execution #parallel #pipes and filters
On Parallel Execution of Multiple Pipelined Hash Joins (HIH, MSC, PSY), pp. 185–196.
VLDBVLDB-1994-ChawatheCY
On Index Selection Schemes for Nested Object Hierarchies (SSC, MSC, PSY), pp. 331–341.
VLDBVLDB-1994-LuOT
On Spatially Partitioned Temporal Join (HL, BCO, KLT), pp. 546–557.
ICALPICALP-1994-AsarinM
On some Relations between Dynamical Systems and Transition Systems (EA, OM), pp. 59–72.
ICALPICALP-1994-AumannBF #bound #cost analysis #fault
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults (YA, JBI, UF), pp. 47–58.
ICALPICALP-1994-BuhrmanT #bound
On the Cutting Edge of Relativization: The Resource Bounded Injury Method (HB, LT), pp. 263–273.
ICALPICALP-1994-JiangL #approximate #sequence
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.
ICALPICALP-1994-Muscholl #automaton
On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.
ICALPICALP-1994-Siegelmann #network #power of #probability
On The Computational Power of Probabilistic and Faulty Neural Networks (HTS), pp. 23–34.
ICALPICALP-1994-Upfal #formal method #network #parallel
On the Theory of Interconnection Networks for Parallel Computers (EU), pp. 473–486.
FMFME-1994-Lindsay #verification
On transferring VDM verification techniques to Z (PAL), pp. 190–213.
ICGTTAGT-1994-Assmann #program analysis #term rewriting
On Edge Addition Rewrite Systems and their Relevance to Program Analysis (UA), pp. 321–335.
ICGTTAGT-1994-KreowskiK
On the Interleaving Sematics of Transformation Units — A Step into GRACE (HJK, SK), pp. 89–106.
CIKMCIKM-1994-Borgida #logic
On The Relationship Between Description Logic and Predicate Logic (AB), pp. 219–225.
CIKMCIKM-1994-OzdenRS #retrieval
On the Storage and Retrieval of Continuous Media Data (BÖ, RR, AS), pp. 322–328.
ICMLICML-1994-SchapireW #algorithm #analysis #learning #worst-case
On the Worst-Case Analysis of Temporal-Difference Learning Algorithms (RES, MKW), pp. 266–274.
KDDKDD-1994-BhandariB #data analysis #statistics
On the Role of Statistical Significance in Exploratory Data Analysis (ISB, SB), pp. 61–72.
KRKR-1994-Bochman
On the Relation Between Default and Modal Consequence Relations (AB), pp. 63–74.
KRKR-1994-FriedmanH94a #complexity #logic
On the Complexity of Conditional Logics (NF, JYH), pp. 202–213.
KRKR-1994-InoueS
On Positive Occurrences of Negation as Failure (KI, CS), pp. 293–304.
KRKR-1994-Jiang #logic #multi #perspective
On Multiagent Autoepistemic Logic : An Extrospective View (YJ), pp. 317–328.
SIGIRSIGIR-1994-EllisFW #consistency #database #effectiveness #hypermedia #metric #retrieval
On the Measurement of Inter-Linker Consistency and Retrieval Effectiveness in Hypertext Databases (DE, JFH, PW), pp. 51–60.
TOOLSTOOLS-EUROPE-1994-Malhotra
On the Construction of Extensible Systems (JM), pp. 255–270.
PPDPALP-1994-Gramlich #composition #confluence #term rewriting #termination
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems (BG), pp. 186–203.
LOPSTRLOPSTR-1994-FlenerP #induction #reasoning #synthesis #using
On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects (PF, LP), pp. 69–87.
LOPSTRLOPSTR-1994-LauO #deduction #framework #logic programming #source code #specification #synthesis
On Specification Frameworks and Deductive Synthesis of Logic Programs (KKL, MO), pp. 104–121.
PLDIPLDI-1994-Agrawal #slicing #source code
On Slicing Programs with Jump Statements (HA), pp. 302–312.
ICSEICSE-1994-GreenspanMB #modelling #requirements #revisited
On Formal Requirements Modeling Languages: RML Revisited (SJG, JM, AB), pp. 135–147.
ICSEICSE-1994-KroneS #source code
On the Inference of Configuration Structures from Source Code (MK, GS), pp. 49–57.
SACSAC-1994-KucherovR #problem #term rewriting #word
On ground reducibility problem for word rewriting systems with variables (GK, MR), pp. 271–276.
SACSAC-1994-Li #equivalence #graph
On the equivalence of pull-up transistor assignment in PLA folding and distribution graph (WNL), pp. 374–378.
CCCC-1994-JanssensS #abstract interpretation #constraints #implementation #logic programming #source code
On the Implementation of Abstract Interpretation Systems for (Constraint) Logic Programs (GJ, WS), pp. 172–187.
DACDAC-1994-KrishnakumarC #hybrid #modelling #set
On the Computation of the Set of Reachable States of Hybrid Models (ASK, KTC), pp. 615–621.
DACDAC-1994-PomeranzR94a #fault
On Improving Fault Diagnosis for Synchronous Sequential Circuits (IP, SMR), pp. 504–509.
DACDAC-1994-ShyurCP #pipes and filters #testing
On Testing Wave Pipelined Circuits (JCS, HPC, TMP), pp. 370–374.
DATEEDAC-1994-HuijbregtsEJ #design
On Design Rule Correct Maze Routing (EPH, JTJvE, JAGJ), pp. 407–411.
PDPPDP-1994-Jennings #architecture #functional
On The Properties Of A Polar Functional Language For A Tagged Token Architecture (GJ), pp. 162–166.
STOCSTOC-1994-BergDS #incremental #lazy evaluation #random
On lazy randomized incremental construction (MdB, KD, OS), pp. 105–114.
STOCSTOC-1994-CondonHPW #automaton #finite #nondeterminism #power of #probability
On the power of finite automata with both nondeterministic and probabilistic states (AC, LH, SP, AW), pp. 676–685.
STOCSTOC-1994-KarlinNT #fault tolerance
On the fault tolerance of the butterfly (ARK, GN, HT), pp. 125–133.
STOCSTOC-1994-KearnsMRRSS
On the learnability of discrete distributions (MJK, YM, DR, RR, RES, LS), pp. 273–282.
STOCSTOC-1994-KrauseP #power of
On the computational power of depth 2 circuits with threshold and modulo gates (MK, PP), pp. 48–57.
STOCSTOC-1994-MacKenziePR #probability #protocol
On contention resolution protocols and associated probabilistic phenomena (PDM, CGP, RR), pp. 153–162.
STOCSTOC-1994-PapadimitriouY #bound #complexity
On complexity as bounded rationality (CHP, MY), pp. 726–733.
STOCSTOC-1994-Pellegrini
On point location and motion planning among simplices (MP), pp. 95–104.
STOCSTOC-1994-TanakaN #complexity #network
On the complexity of negation-limited Boolean networks (KT, TN), pp. 38–47.
CADECADE-1994-Bundgen #how
On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs (RB), pp. 693–707.
CADECADE-1994-Lysne #consistency #proving
On the Connection between Narrowing and Proof by Consistency (OL), pp. 133–147.
CADECADE-1994-RoyerQ #query
On Intuitionistic Query Answering in Description Bases (VR, JQ), pp. 326–340.
CADECADE-1994-WirthG #equation #induction
On Notions of Inductive Validity for First-Oder Equational Clauses (CPW, BG), pp. 162–176.
CAVCAV-1994-BalarinS #automation #invariant #network
On the Automatic Computation of Network Invariants (FB, ALSV), pp. 234–246.
CAVCAV-1994-MihailP #protocol #random #testing
On the Random Walk Method for Protocol Testing (MM, CHP), pp. 132–141.
ICLPICLP-1994-SakamaI #abduction #equivalence #logic programming #source code
On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.
ICLPICLP-1994-Zhou #prolog #stack
On the Scheme of Passing Arguments in Stack Frames for Prolog (NFZ), pp. 159–174.
ICLPILPS-1994-DekhtyarD #behaviour #database #deduction
On Stable Behaviour of Dynamic Deductive Data Bases (MID, AJD), p. 677.
LICSLICS-1994-ColsonE #higher-order
On Strong Stability and Higher-Order Sequentiality (LC, TE), pp. 103–108.
LICSLICS-1994-GeuversW #type system
On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study (HG, BW), pp. 320–329.
LICSLICS-1994-ZhangSS #calculus #complexity #model checking #parallel #μ-calculus
On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.
ICDARICDAR-1993-HochK #clustering #recognition #scalability
On virtual partitioning of large dictionaries for contextual post-processing to improve character recognition (RH, TK), pp. 226–231.
ICDARICDAR-1993-HoriuchiTYY #recognition #using
On method of training dictionaries for handwritten character recognition using relaxation matching (TH, KT, KY, HY), pp. 638–641.
ICDARICDAR-1993-Lu #segmentation
On the segmentation of touching characters (YL), pp. 440–443.
ICDARICDAR-1993-OhkuraSSH #using
On discrimination of handwritten similar KANJI characters by subspace method using several features (MO, YS, MS, RH), pp. 589–592.
ICDARICDAR-1993-Sinha #constraints #recognition #using
On using syntactic constraints in text recognition (RMKS), pp. 858–861.
ICDARICDAR-1993-TakeshitaNK #bias #distance
On the bias of Mahalanobis distance due to limited sample size effect (TT, SN, FK), pp. 171–174.
PODSPODS-1993-ChomickiN #constraints
On the Feasibility of Checking Temporal Integrity Constraints (JC, DN), pp. 202–213.
PODSPODS-1993-RastogiMBKS #correctness
On Correctness of Non-serializable Executions (RR, SM, YB, HFK, AS), pp. 97–108.
PODSPODS-1993-Revesz #semantics
On the Semantics of Theory Change: Arbitration between Old and New Information (PZR), pp. 71–82.
SIGMODSIGMOD-1993-BeeriM #algebra #power of #recursion
On the Power of Algebras with Recursion (CB, TM), pp. 377–386.
SIGMODSIGMOD-1993-LoCRY #pipes and filters
On Optimal Processor Allocation to Support Pipelined Hash Joins (MLL, MSC, CVR, PSY), pp. 69–78.
VLDBVLDB-1993-GhandeharizadehHJCELLTZ #database #execution #implementation #modelling #specification
On Implementing a Language for Specifying Active Database Execution Models (SG, RH, DJ, JC, MEM, SHL, JL, CT, GZ), pp. 441–454.
VLDBVLDB-1993-LanzelotteVZ #effectiveness #execution #optimisation #parallel
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces (RSGL, PV, MZ), pp. 493–504.
DLTDLT-1993-CulikK #generative #image #power of
On the Power of L-Systems in Image Generation (KCI, JK), pp. 225–236.
DLTDLT-1993-Georgescu #context-free grammar
On the Index of Pure Context-free Grammars and Languages (GG), pp. 60–69.
DLTDLT-1993-Honkala
On Lindenmayerian Series in Complete Semirings (JH), pp. 179–192.
DLTDLT-1993-Pardubska #communication #generative #power of
On the Power of Communication Structure for Distributive Generation of Languages (DP), pp. 419–429.
ICALPICALP-1993-DolevM #algorithm #distributed
On Distributed Algorithms in a Broadcast Domain (DD, DM), pp. 371–387.
ICALPICALP-1993-KarpinskiV #random
On Randomized Versus Deterministic Computation (MK, RV), pp. 227–240.
ICALPICALP-1993-Lepisto #morphism #power of
On the Power of Periodic Iteration of Morphisms (AL), pp. 496–506.
ICALPICALP-1993-OchmanskiW
On Regular Compatibility of Semi-Commutations (EO, PAW), pp. 445–456.
ICALPICALP-1993-Orponen #power of
On the Computational Power of Discrete Hopfield Nets (PO), pp. 215–226.
FMFME-1993-GuntherSW #database #execution #source code #specification
On the Derivation of Executable Database Programs from Formal Specifications (TG, KDS, IW), pp. 351–366.
RTARTA-1993-Adian #algorithm #monad #problem
On some Algorithmic Problems for Groups and Monoids (SIA), pp. 289–300.
RTARTA-1993-ChakrabartiY #algorithm #correctness #distributed #memory management
On the Correctness of a Distributed Memory Gröbner basis Algorithm (SC, KAY), pp. 77–91.
TLCATLCA-1993-Akama #calculus #reduction
On Mints’ Reduction for ccc-Calculus (YA), pp. 1–12.
FPCAFPCA-1993-HammarlundL #functional #parallel #programming language
On the Relation between Functional and Data Parallel Programming Languages (PH, BL), pp. 210–222.
HCIHCI-ACS-1993-SuzukiH #effectiveness #variability
On a Simple and Effective Method to Analyze Heart Rate Variability (KS, YH), pp. 914–919.
HCIHCI-ACS-1993-VekkerAY #complexity
On Psychophysiology of Cognitive Complexity (LV, JAA, YY), pp. 605–610.
HCIHCI-SHI-1993-BoczkowskiNR #hypermedia #process
On the Relationships between Hypermedia and the Psychotherapeutic Process (PB, FDN, GR), pp. 476–481.
CIKMCIKM-1993-BarlosF #database #development #distributed #parallel
On the Development of a site Selection Optimizer for Distributed and Parallel Database Systems (FB, OF), pp. 684–693.
CIKMCIKM-1993-Dress #modelling
On Modeling and Controlling Intelligent Systems (WBD), pp. 223–232.
CIKMCIKM-1993-KamelF
On Packing R-trees (IK, CF), pp. 490–499.
CIKMCIKM-1993-Papazoglou #database #distributed
On the Duality of Distributed Databases and Distributed AI Systems (MPP), pp. 1–10.
SIGIRSIGIR-1993-LeeKKL #evaluation #framework #retrieval
On the Evaluation of Boolean Operators in the Extended Boolean Retrieval Framework (JHL, WYK, MHK, YJL), pp. 291–297.
OOPSLAOOPSLA-1993-HoydalsvikS #analysis #object-oriented
On the Purpose of Object-Oriented Analysis (GMH, GS), pp. 240–255.
TOOLSTOOLS-USA-1993-CorriveauW #evolution #framework #tool support
On the Evolution of a Framework for the ObjecTime Toolset (JPC, LW), pp. 337–349.
POPLPOPL-1993-WeeksF #algol #orthogonal
On the Orthogonality of Assignments and Procedures in Algol (SW, MF), pp. 57–70.
RERE-1993-HarrisonB #interactive #requirements
On defining requirements for interaction (MDH, PJB), pp. 50–54.
ESECESEC-1993-Buxton #programming
On the Decline of Classical Programming (JNB), pp. 1–9.
SACSAC-1993-ChoenniBC #automation #database #design #physics
On the Automation of Physical Database Design (SC, HMB, TC), pp. 358–367.
SACSAC-1993-KelleherLD #equation #parallel #performance #reduction
On the Performance of a Direct Parallel Method for Solving Separable Elliptic Equations Based on Block Cyclic Reduction (KK, SL, SKD), pp. 517–524.
SACSAC-1993-MotzkinJHK #concurrent #execution #information management
On Concurrent Execution of Information Systems Applications (DM, EJ, DH, MK), pp. 775–781.
DACDAC-1993-ChanSZ #array #predict #programmable
On Routability Prediction for Field-Programmable Gate Arrays (PKC, MDFS, JYZ), pp. 326–330.
DACDAC-1993-CongD #trade-off
On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping (JC, YD), pp. 213–218.
DACDAC-1993-MatsunagaMB #transitive
On Computing the Transitive Closure of a State Transition Relation (YM, PCM, RKB), pp. 260–265.
PDPPDP-1993-VeglisP #multi #network
On the bandwidth availability of multistage interconnection networks (AAV, ASP), pp. 284–290.
STOCSTOC-1993-LundY #approximate #problem
On the hardness of approximating minimization problems (CL, MY), pp. 286–293.
STOCSTOC-1993-Shamir #generative #multi
On the generation of multivariate polynomials which are hard to factor (AS), pp. 796–804.
TAPSOFTTAPSOFT-1993-DeganoGV #concurrent #modelling
On Relating Some Models for Concurrency (PD, RG, SV), pp. 15–30.
TAPSOFTTAPSOFT-1993-Thomas #game studies
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science (WT), pp. 559–568.
TAPSOFTTAPSOFT-1993-Tyszkiewicz #logic
On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering (JT), pp. 569–583.
CAVCAV-1993-EmersonJS #calculus #model checking #μ-calculus
On Model-Checking for Fragments of μ-Calculus (EAE, CSJ, APS), pp. 385–396.
CSLCSL-1993-AmblerKM #calculus #μ-calculus
On Duality for the Modal μ-Calculus (SA, MZK, NM), pp. 18–32.
CSLCSL-1993-GoerdtK #backtracking #parallel
On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search (AG, UK), pp. 106–127.
ICLPICLP-1993-Debray
On Copy Avoidance in Single Assignment Languages (SKD), pp. 393–407.
ICLPILPS-1993-Harland #logic
On Goal-Directed Provability in Classical Logic (JH), p. 677.
ICLPILPS-1993-McDonaldXEF #logic #semantics
On the Denotational and Logical Semantics of CLP-Modules (BM, JX, ME, EF), p. 658.
ICLPILPS-1993-Zhou #compilation #parametricity #prolog
On the Direct Parameter Passing Mechanism for Prolog Compilers (NFZ), p. 655.
ICTSSIWPTS-1993-PetrenkoDK #evaluation #protocol #testing
On Evaluation of Testability of Protocol Structures (AP, RD, HK), pp. 111–124.
PODSPODS-1992-ChaudhuriV #datalog #equivalence #recursion #source code
On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.
PODSPODS-1992-EiterG #complexity #knowledge base
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals (TE, GG), pp. 261–273.
PODSPODS-1992-Jakobsson #evaluation #query
On Tree-Based Techniques for Query Evaluation (HJ), pp. 380–392.
SIGMODSIGMOD-1992-TsangarisN #clustering #performance
On the Performance of Object Clustering Techniques (MMT, JFN), pp. 144–153.
VLDBVLDB-1992-FaloutsosJ
On B-Tree Indices for Skewed Distributions (CF, HVJ), pp. 363–374.
CSEETSEI-1992-HoffmanS #education #process
On Teaching the Rational Desighn Process (DH, TS), pp. 44–62.
ICALPICALP-1992-BuntrockL #context-sensitive grammar
On Growing Context-Sensitive Languages (GB, KL), pp. 77–88.
ICALPICALP-1992-Debray #analysis #complexity #data flow #logic programming #source code
On the Complexity of Dataflow Analysis of Logic Programs (SKD), pp. 509–520.
ICALPICALP-1992-PatersonY #graph #nearest neighbour
On Nearest-Neighbor Graphs (MP, FFY), pp. 416–426.
ICALPICALP-1992-PeladeauP
On Reverse and General Definite Tree Languages (PP, AP), pp. 150–161.
LISPLFP-1992-TannenS #abstraction
On Extending Computational Adequacy by Data Abstraction (VT, RS), pp. 161–169.
KRKR-1992-CroccoL #logic
On the Connection between Non-monotonic Inference Systems and Conditional Logics (GC, PL), pp. 565–571.
KRKR-1992-NiemelaR #complexity #reasoning
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning (IN, JR), pp. 627–638.
ICMLML-1992-AlmuallimD #concept #learning
On Learning More Concepts (HA, TGD), pp. 11–19.
ICMLML-1992-Segre #multi
On Combining Multiple Speedup Techniques (AMS), pp. 400–405.
ECOOPECOOP-1992-Kim #database #object-oriented #relational
On Unifying Relational and Object-Oriented Database Systems (WK), pp. 1–18.
TOOLSTOOLS-PACIFIC-1992-Kim92b #database #object-oriented #relational
On Unifying Relational and Object-Oriented Database Systems (WK), pp. 5–17.
PPDPALP-1992-BoudetC #equation
On n-Syntactic Equational Theories (AB, EC), pp. 446–457.
PPDPALP-1992-Hermann #recursion
On the Relation Between Primitive Recursion, Schematization and Divergence (MH), pp. 115–127.
LOPSTRLOPSTR-1992-Demoen #performance #prolog
On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.
PPDPPLILP-1992-BossiCE
On Safe Folding (AB, NC, SE), pp. 172–186.
PPDPPLILP-1992-HansLW #backtracking #evaluation #interactive #lazy evaluation
On the Interaction of Lazy Evaluation and Backtracking (WH, RL, SW), pp. 355–369.
SASWSA-1992-CharlierH #abstract interpretation #design #framework
On the Design of Generic Abstract Interpretation Frameworks (BLC, PVH), pp. 229–246.
SASWSA-1992-GloessHLH
On Boolean Feature Types (PYG, YNH, CML, MAH), pp. 213–220.
ASEKBSE-1992-Liao #execution #performance
On Efficiently Computing Derived Performance Data of Program Execution (YL), p. 25.
CCCC-1992-SudholtS #analysis #data flow #interprocedural #object-oriented
On Interprocedural Data Flow Analysis for Object Oriented Languages (MS, CS), pp. 156–162.
DACDAC-1992-AnastasakisGKP #approximate #evaluation
On the Stability of Moment-Matching Approximations in Asymptotic Waveform Evaluation (DFA, NG, SYK, LTP), pp. 207–212.
DACDAC-1992-ChengM #algorithm #problem
On the Over-Specification Problem in Sequential ATPG Algorithms (KTC, HKTM), pp. 16–21.
DACDAC-1992-LeeR92a #concurrent #fault #performance #simulation
On Efficient Concurrent Fault Simulation for Synchronous Sequential Circuits (DHL, SMR), pp. 327–331.
DACDAC-1992-LiLAS #implementation #problem
On the Circuit Implementation Problem (WNL, AL, PA, SS), pp. 478–483.
DACDAC-1992-MajumdarS #fault #random testing #testing
On the Distribution of Fault Coverage and Test length in Random Testing of Combinational Circuits (AM, SS), pp. 341–346.
DACDAC-1992-ShenoySBS #equivalence
On the Temporal Equivalence of Sequential Circuits (NVS, KJS, RKB, ALSV), pp. 405–409.
HPDCHPDC-1992-VarshneyD #multi #network
On Flow Control in Multimedia Networks (PKV, SD), pp. 197–205.
STOCSTOC-1992-FeigeL #matrix #random
On the Hardness of Computing the Permanent of Random Matrices (UF, CL), pp. 643–654.
STOCSTOC-1992-Kelsen #complexity #independence #parallel #set
On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.
STOCSTOC-1992-MalitzP #graph
On the Angular Resolution of Planar Graphs (SMM, AP), pp. 527–538.
STOCSTOC-1992-NisanS
On the Degree of Boolean Functions as Real Polynomials (NN, MS), pp. 462–467.
STOCSTOC-1992-Paturi #approximate #symmetry
On the Degree of Polynomials that Approximate Symmetric Boolean Functions (RP), pp. 468–474.
STOCSTOC-1992-Seidel #problem
On the All-Pairs-Shortest-Path Problem (RS), pp. 745–749.
STOCSTOC-1992-SimonS #complexity #ram #set
On the Complexity of RAM with Various Operation Sets (JS, MS), pp. 624–631.
CSLCSL-1992-Gonzalez-MorenoHR #functional #logic programming #semantics
On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming (JCGM, MTHG, MRA), pp. 216–230.
CSLCSL-1992-Tyszkiewicz #higher-order #monad
On Asymptotic Probabilities of Monadic Second Order Properties (JT), pp. 425–439.
ICTSSIWPTS-1992-ChansonL #consistency #testing
On Inconclusive Verdict in Conformance Testing (STC, QL), pp. 81–92.
ICTSSIWPTS-1992-Sherman #testing
On Interoperability Testing (PS), pp. 165–166.
ICTSSIWPTS-1992-VerhaardTKB #testing
On Asynchronous Testing (LV, JT, PK, EB), pp. 55–66.
ICLPJICSLP-1992-AlferesP #logic programming #semantics
On Logic Program Semantics with Two Kinds of Negation (JJA, LMP), pp. 574–588.
ICLPJICSLP-1992-Hanus
On the Completeness of Residuation (MH), pp. 192–206.
ICLPJICSLP-1992-Harland #equivalence #logic programming #normalisation #source code
On Normal Forms and Equivalence for Logic Programs (JH), pp. 146–160.
PODSPODS-1991-AfratiCY #datalog #polynomial
On Datalog vs. Polynomial Time (FNA, SSC, MY), pp. 13–25.
PODSPODS-1991-BaudinetNW #infinity #query #representation
On the Representation of Infinite Temporal Data and Queries (MB, MN, PW), pp. 280–290.
PODSPODS-1991-HullY #database #equivalence #identifier
On the Equivalence of Database Restructurings Involving Object Identifiers (RH, MY), pp. 328–340.
PODSPODS-1991-Ross91a
On Negation in HiLog (KAR), pp. 206–215.
PODSPODS-1991-SeshadriN #datalog #query #recursion
On the Expected Size of Recursive Datalog Queries (SS, JFN), pp. 268–279.
PODSPODS-1991-Vadaparty #power of #rule-based #set
On the Power of Rule-Based Languages with Sets (KVV), pp. 26–36.
SIGMODSIGMOD-1991-IoannidisC #fault
On the Propagation of Errors in the Size of Join Results (YEI, SC), pp. 268–277.
ICALPICALP-1991-DiekertOR #complexity #confluence #decidability
On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
ICALPICALP-1991-DurisG #multi #power of
On the Power of Multiple Reads in a Chip (PD, ZG), pp. 697–706.
ICALPICALP-1991-GabbrielliL #logic programming #semantics #source code
On the Semantics of Logic Programs (MG, GL), pp. 1–19.
ICALPICALP-1991-GrogerT #linear
On Linear Decision Trees Computing Boolean Functions (HDG, GT), pp. 707–718.
ICALPICALP-1991-Thomas #automaton #logic
On Logics, Tilings, and Automata (WT), pp. 441–454.
RTARTA-1991-BonacinaH #proving #theorem proving
On Fairness of Completion-Based Theorem Proving Strategies (MPB, JH), pp. 348–360.
RTARTA-1991-CurienG #confluence #normalisation
On Confluence for Weakly Normalizing Systems (PLC, GG), pp. 215–225.
RTARTA-1991-Hermann #proving
On Proving Properties of Completion Strategies (MH), pp. 398–410.
RTARTA-1991-Kucherov #term rewriting
On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.
RTARTA-1991-Marche
On Ground AC-Completion (CM), pp. 411–422.
FMVDME-1991-Arthan #proving #specification
On Formal Specification of a Proof Tool (RDA), pp. 356–370.
FMVDME-1991-DammHB #consistency #type checking
On Type Checking in VDM and Related Consistency Issues (FMD, BSH, HB), pp. 45–62.
FPCAFPCA-1991-VolpanoS #complexity #ml
On the Complexity of ML Typability with Overloading (DMV, GS), pp. 15–28.
KDDKDD-1991-Schaffer #evaluation #independence
On Evaluation of Domain-Independent Scientific Function-Finding Systems (CS), pp. 93–106.
KDDKDD-1991-Yager #summary
On Linguistic Summaries of Data (RRY), pp. 347–366.
KRKR-1991-KatsunoM #difference #knowledge base
On the Difference between Updating a Knowledge Base and Revising It (HK, AOM), pp. 387–394.
KRKR-1991-Lakemeyer
On the Relation between Explicit and Implicit Belief (GL), pp. 368–375.
ICMLML-1991-ChienGD #learning
On Becoming Decreasingly Reactive: Learning to Deliberate Minimally (SAC, MTG, GD), pp. 288–292.
ICMLML-1991-Saxena #representation
On the Effect of Instance Representation on Generalization (SS), pp. 198–202.
SIGIRSIGIR-1991-FriederS #documentation #information retrieval #multi
On the Allocation of Documents in Multiprocessor Information Retrieval Systems (OF, HTS), pp. 230–239.
LOPSTRLOPSTR-1991-AlexandreBQ #logic programming #source code #using
On Using Mode Input-output for Transforming Logic Programs (FA, KB, AQ), pp. 129–146.
PPDPPLILP-1991-KosterB #source code
On the Borderline Between Grammars and Programs (CHAK, JB), pp. 219–230.
POPLPOPL-1991-SekarMR #abstract interpretation #analysis #strict
On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation (RCS, PM, IVR), pp. 37–48.
SASWSA-1991-Malmkjaer #source code
On Static Properties of Specialized Programs (KM), pp. 234–241.
DACDAC-1991-CaiW
On Minimizing the Number of L-Shaped Channels (YC, DFW), pp. 328–334.
DACDAC-1991-Cheng
On Removing Redundancy in Sequential Circuits (KTC), pp. 164–169.
DACDAC-1991-DuttL #assembly #constraints #generative
On Minimal Closure Constraint Generation for Symbolic Cell Assembly (DD, CYL), pp. 736–739.
DACDAC-1991-PomeranzR #fault #using
On Achieving a Complete Fault Coverage for Sequential Machines Using the Transition Fault Model (IP, SMR), pp. 341–346.
ESOPESOP-J-1990-Felleisen91 #power of #programming language
On the Expressive Power of Programming Languages (MF), pp. 35–75.
TAPSOFTCAAP-1991-Ferrari #incremental
On Causality Observed Incrementally, Finally (GLF), pp. 26–41.
TAPSOFTCAAP-1991-JonssonL #algebra #complexity #equation #process
On the Complexity of Equation Solving in Process Algebra (BJ, KGL), pp. 381–396.
TAPSOFTCAAP-1991-Kwiatkowska #composition
On the Domain of Traces and Sequential Composition (MZK), pp. 42–56.
TAPSOFTCCPSD-1991-BrlekCS
On Addition Schemes (SB, PC, RS), pp. 379–393.
TAPSOFTCCPSD-1991-Frutos-EscrigF #strict
On Narrowing Strategies for Partial Non-Strict Functions (DdFE, MIFC), pp. 416–437.
TAPSOFTCCPSD-1991-LoweEFJ #algebra #specification
On the Relationship Between Algebraic Module Specifications and Program Modules (ML, HE, WF, DJ), pp. 83–98.
STOCSTOC-1991-LubyV #approximate
On Deterministic Approximation of DNF (ML, BV), pp. 430–438.
CSLCSL-1991-Flum #bound
On Bounded Theories (JF), pp. 111–118.
CSLCSL-1991-Gradel #logic #transitive
On Transitive Closure Logic (EG), pp. 149–163.
CSLCSL-1991-Stewart
On Completeness for NP via Projection Translations (IAS), pp. 353–366.
CSLCSL-1991-Voronkov #synthesis
On Completeness of Program Synthesis Systems (AV), pp. 411–418.
ICLPICLP-1991-Bottcher #logic programming #programming language #transaction
On Transactions in Logic Programming Languages (SB), p. 889.
ICLPICLP-1991-Decker #axiom
On Generalized Cover Axioms (HD), pp. 693–707.
ICLPICLP-1991-Levi #logic programming #semantics #source code
On the Semantics of Logic Programs (GL), p. 945.
ICTSSIWPTS-1991-ChansonL #protocol #testing
On Static and Dynamic Test Case Selections in Protocol Confomance Testing (STC, QL), pp. 255–266.
ICTSSIWPTS-1991-Hogrefe #consistency #development #standard #testing
On the Development of a Standard for Conformance Testing Based on Formal Specifictations (DH), pp. 59–66.
ICTSSIWPTS-1991-VuongA #communication #metric #protocol #test coverage
On Test Coverage Metrics for Communication Protocols (STV, JAC), pp. 31–45.
LICSLICS-1991-AvronH #database #first-order #query
On First Order Database Query Languages (AA, YH), pp. 226–231.
LICSLICS-1991-BonetB #deduction #proving
On the Deduction Rule and the Number of Proof Lines (MLB, SRB), pp. 286–297.
LICSLICS-1991-Howe #type system
On Computational Open-Endedness in Martin-Löf’s Type Theory (DJH), pp. 162–172.
LICSLICS-1991-PacholskiS #higher-order #similarity
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.
LICSLICS-1991-Vaandrager #algebra #automaton #process
On the Relationship Between Process Algebra and Input/Output Automata (FWV), pp. 387–398.
PODSPODS-1990-Abdel-GhaffarA
On the Optimality of Disk Allocation for Cartesian Product Files (KASAG, AEA), pp. 258–264.
PODSPODS-1990-HaritsaCL #constraints #realtime
On Being Optimistic about Real-Time Constraints (JRH, MJC, ML), pp. 331–343.
PODSPODS-1990-KolaitisV #case study #datalog #power of #tool support
On the Expressive Power of Datalog: Tools and a Case Study (PGK, MYV), pp. 61–71.
PODSPODS-1990-Tay #multi
On the Optimality of Strategies for Multiple Joins (YCT), pp. 124–131.
SIGMODSIGMOD-1990-StonebrakerJGP #database
On Rules, Procedures, Caching and Views in Data Base Systems (MS, AJ, JG, SP), pp. 281–290.
VLDBVLDB-1990-Hulin #normalisation
On Restructuring Nested Relations in Partitioned Normal Form (GH), pp. 626–637.
VLDBVLDB-1990-Jagadish
On Indexing Line Segments (HVJ), pp. 614–625.
ICALPICALP-1990-GoldreichK #composition #proving
On the Composition of Zero-Knowledge Proof Systems (OG, HK), pp. 268–282.
ICALPICALP-1990-Hoffmann #problem
On the Rectilinear Art Gallery Problem (FH), pp. 717–728.
ICALPICALP-1990-LucaV
On Non-Counting Regular Classes (AdL, SV), pp. 74–87.
ICALPICALP-1990-MatiasV #integer #parallel #sorting
On Parallel Hashing and Integer Sorting (YM, UV), pp. 729–743.
ICALPICALP-1990-PanR #multi
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (VYP, JHR), pp. 612–625.
ICALPICALP-1990-Razborov #complexity
On the Distributional Complexity of Disjontness (AAR), pp. 249–253.
ICALPICALP-1990-SavageW #clustering #heuristic
On Parallelizing Graph-Partitioning Heuristics (JES, MGW), pp. 476–489.
FMVDME-1990-BlikleT #development #process #syntax
On Conservative Extensions of Syntax in the Process of System Development (AB, MT), pp. 504–525.
SIGIRSIGIR-1990-Huther #taxonomy
On the Interrelationship of Dictionary Size and Completeness (HH), pp. 313–325.
PPDPALP-1990-Dung #logic programming #source code
On the strong completion of logic programs (PMD), pp. 158–172.
PPDPALP-1990-Saint-Dizier #dependence #logic programming
On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logic (PSD), pp. 232–246.
PLDIPLDI-1990-Giegerich #code generation #specification
On the Structure of Verifiable Code Generator Specifications (RG), pp. 1–8.
PPDPPLILP-1990-DumortierB #automation #generative #prolog
On the Automatic Generation of Events in Delta Prolog (VD, MB), pp. 324–339.
POPLPOPL-1990-Deutsch #alias #functional #higher-order #specification
On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications (AD), pp. 157–168.
POPLPOPL-1990-Field #analysis #lazy evaluation #specification #tool support
On Laziness and Optimality in λ Interpreters: Tools for Specification and Analysis (JF), pp. 1–15.
POPLPOPL-1990-Russell #network #principle
On Oraclizable Networks and Kahn’s Principle (JRR), pp. 320–328.
POPLPOPL-1990-Stark #automaton #concurrent
On the Relations Computable by a Class of Concurrent Automata (EWS), pp. 329–340.
ICSEICSE-1990-Laprie #assessment #safety
On the Assessment of Safety-Critical Software Systems (JCL), p. 222.
DACDAC-1990-Chakravarty #identification
On Synthesizing and Identifying Stuck-Open Testable CMOS Combinational Circuits (SC), pp. 736–739.
ESOPESOP-1990-Felleisen #power of #programming language
On the Expressive Power of Programming Languages (MF), pp. 134–151.
ESOPESOP-1990-SchnoebelenP #logic
On the Weak Adequacy of Branching-Time Remporal Logic (PS, SP), pp. 377–388.
STOCSTOC-1990-Ben-DavidBKTW #algorithm #online #power of
On the Power of Randomization in Online Algorithms (SBD, AB, RMK, GT, AW), pp. 379–386.
STOCSTOC-1990-BoardP #algorithm
On the Necessity of Occam Algorithms (RAB, LP), pp. 54–63.
STOCSTOC-1990-BorodinT #decidability #polynomial
On the Decidability of Sparse Univariate Polynomial Interpolation (AB, PT), pp. 535–545.
STOCSTOC-1990-Cole
On the Dynamic Finger Conjecture for Splay Trees (RC0), pp. 8–17.
STOCSTOC-1990-Lakshman #complexity
On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal (YNL), pp. 555–563.
STOCSTOC-1990-OgiwaraW #bound #polynomial #set
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (MO, OW), pp. 457–467.
STOCSTOC-1990-PapadimitriouSY #complexity
On the Complexity of Local Search (CHP, AAS, MY), pp. 438–445.
CADECADE-1990-BachmairG #order #strict
On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.
CAVCAV-1990-Cleaveland #automation #bisimulation
On Automatically Explaining Bisimulation Inequivalence (RC), pp. 364–372.
CAVCAV-1990-LaiPD #protocol #using #verification
On Using Protean To Verify ISO FTAM Protocol (RL, KRP, TSD), pp. 126–135.
ICLPCLP-1990-ChengER90 #functional #logic #programming
On Warren’s Method for Functional Programming in Logic (MHMC, MHvE, BER), pp. 546–560.
CSLCSL-1990-BlassG #complexity #reduction
On the Reduction Theory for Average Case Complexity (AB, YG), pp. 17–30.
CSLCSL-1990-Stark #fixpoint #logic
On the Existence of Fixpoints in Moore’s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle (RFS), pp. 354–365.
CSLCSL-1990-Szabo #automation #deduction
On the Tracking of Loops in Automated Deductions (MES), pp. 366–388.
LICSLICS-1990-Courcelle #graph #higher-order #monad #set
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (BC), pp. 190–196.
LICSLICS-1990-DorreR #algebra
On Subsumption and Semiunification in Feature Algebras (JD, WCR), pp. 300–310.
LICSLICS-1990-EmersonES #decidability #performance
On the Limits of Efficient Temporal Decidability (EAE, ME, JS), pp. 464–475.
LICSLICS-1990-HarelRV #bound #concurrent #power of #reasoning #source code
On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
ICLPNACLP-1990-GuptaJ90a #execution #logic programming #modelling #source code
On Criteria for Or-Parallel Execution Models of Logic Programs (GG, BJ), pp. 737–756.
ICLPNACLP-1990-Helm #execution
On the Elimination of Redundant Derivations During Execution (RH), pp. 551–568.
ICLPNACLP-1990-Lobo #logic programming #source code
On Constructive Negation for Disjunctive Logic Programs (JL), pp. 704–718.
PODSPODS-1989-Cosmadakis #first-order #query #recursion
On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
PODSPODS-1989-Seki #power of
On the Power of Alexander Templates (HS), pp. 150–159.
SIGMODSIGMOD-1989-Dong #database #datalog #distributed #query
On Distributed Processibility of Datalog Queries by Decomposing Databases (GD), pp. 26–35.
SIGMODSIGMOD-1989-Dyson
On Beyond Data (ED), p. 1.
SIGMODSIGMOD-1989-HullS #complexity #database #object-oriented #strict
On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (RH, JS), pp. 147–158.
SIGMODSIGMOD-1989-MarkowitzS #correctness #relational #representation
On the Correctness of Representing Extended Entity-Relationship Structures in the Relational Model (VMM, AS), pp. 430–439.
VLDBVLDB-1989-AgrawalJ #configuration management #version control
On Correctly Configuring Versioned Objects (RA, HVJ), pp. 367–374.
VLDBVLDB-1989-Olive #concept #deduction #design #implementation #information management #modelling
On the design and implementation of information systems from deductive conceptual models (AO), pp. 3–11.
ICALPICALP-1989-EhrigPO #algebra #roadmap #specification
On Recent Trends in Algebraic Specification (HE, PP, FO), pp. 263–288.
ICALPICALP-1989-FeldmanINNRS #generative #modelling #random
On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
ICALPICALP-1989-PnueliR #synthesis
On the Synthesis of an Asynchronous Reactive Module (AP, RR), pp. 652–671.
RTARTA-1989-Lai #commutative #how
On How To Move Mountains “Associatively and Commutatively” (ML), pp. 187–202.
FPCAFPCA-1989-WandO #complexity #type inference
On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.
CAiSECAiSE-1989-Assche #automation #future of #tool support
On the Future of CASE Tools (FVA).
CAiSECAiSE-1989-Rolland #automation #future of #modelling #tool support #why
On the Future of Modelling — Why Current CASE Tools Insist on Supporting 20 Years Old Methods and Techniques (CR).
CAiSECAiSE-1989-Schefstrom #integration #tool support
On Posteriori Integration of Software Tools (DS).
KRKR-1989-Cohn #framework #hybrid #reasoning
On the Appearance of Sortal Literals: a Non Substitutional Framework for Hybrid Reasoning (AGC), pp. 55–66.
ICMLML-1989-BlytheM
On Becoming Reactive (JB, TMM), pp. 255–259.
SIGIRSIGIR-1989-SaltonS #analysis #automation
On the Application of Syntactic Methodologies in Automatic Text Analysis (GS, MS), pp. 137–150.
POPLPOPL-1989-PnueliR #synthesis
On the Synthesis of a Reactive Module (AP, RR), pp. 179–190.
DACDAC-1989-DuYG #analysis #problem
On the General False Path Problem in Timing Analysis (DHCD, SHY, SG), pp. 555–560.
DACDAC-1989-Groenveld
On Global Wire Ordering for Macro-Cell Routing (PG), pp. 155–160.
DACDAC-1989-HemmadyR
On the Repair of Redundant RAMs (VGH, SMR), pp. 710–713.
TAPSOFTAS-1989-VissersSSB #design #distributed #using
On the Use of Specifiation Styles in the Design of Distributed Systems (Abstract) (CAV, GS, MvS, EB), p. 60.
TAPSOFTCAAP-1989-AstesianoC #higher-order #modelling #specification
On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications (EA, MC), pp. 74–88.
STOCSTOC-1989-AlonBLP #communication #complexity
On the Complexity of Radio Communication (NA, ABN, NL, DP), pp. 274–285.
STOCSTOC-1989-Ben-DavidCGL #complexity #formal method
On the Theory of Average Case Complexity (SBD, BC, OG, ML), pp. 204–216.
STOCSTOC-1989-Bshouty
On the Extended Direct Sum Conjecture (NHB), pp. 177–185.
STOCSTOC-1989-FellowsL #algorithm #performance #polynomial
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (MRF, MAL), pp. 501–512.
STOCSTOC-1989-FriedmanKS #graph #random
On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.
STOCSTOC-1989-GrahamY
On the Improbability of Reaching Byzantine Agreements (RLG, ACCY), pp. 467–478.
STOCSTOC-1989-Razborov #approximate
On the Method of Approximations (AAR), pp. 167–176.
STOCSTOC-1989-SafraV #automaton #logic
On ω-Automata and Temporal Logic (SS, MYV), pp. 127–137.
STOCSTOC-1989-SchmidtS #aspect-oriented #performance
On Aspects of Universality and Performance for Closed Hashing (JPS, AS), pp. 355–366.
CSLCSL-1989-AntoniouS #verification
On the Verification of Modules (GA, VS), pp. 16–35.
CSLCSL-1989-Dahn
On Test Classes for Universal Theories (BID), pp. 90–97.
CSLCSL-1989-Gradel #complexity #concept #logic
On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.
CSLCSL-1989-Parigot #representation #λ-calculus
On the Representation of Data in λ-Calculus (MP), pp. 309–321.
CSLCSL-1989-SpeckenmeyerK #clustering #complexity #set
On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.
LICSLICS-1989-EmersonJ #automaton
On Simultaneously Determinizing and Complementing ω-Automata (EAE, CSJ), pp. 333–342.
LICSLICS-1989-Fernando #recursion #set
On Substitutional Recursion Over Non-Well-Founded Sets (RTPF), pp. 273–282.
LICSLICS-1989-Vardi #complexity #reasoning
On the Complexity of Epistemic Reasoning (MYV), pp. 243–252.
ICLPNACLP-1989-DungK #source code
On the Generalized Predicate Completion of Non-Horn Programs (PMD, KK), pp. 587–603.
ICLPNACLP-1989-HeintzeMSY #metaprogramming
On Meta-Programming in CLR(R) (NH, SM, PJS, RHCY), pp. 52–66.
ICLPNACLP-1989-Helm #bottom-up #execution
On the Dedection and Elimination of Redundant Derivations during Bottom-up Execution (ARH), pp. 945–962.
ICLPNACLP-1989-HermenegildoR #correctness #independence #logic programming #performance #source code
On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs (MVH, FR), pp. 369–389.
ICLPNACLP-1989-KiferS #logic programming #power of #source code
On the Expressive Power of Annotated Logic Programs (MK, VSS), pp. 1069–1089.
ICLPNACLP-1989-MadanPS #lisp #prolog
On the Adequacy of Direct Mapped Caches for Lisp and Prolog Data Reference Patterns (VSM, CJP, GSS), pp. 888–906.
ICLPNACLP-1989-MarienD
On the Management of Choicepoint and Environment Frames in the WAM (AM, BD), pp. 1030–1047.
ICLPNACLP-1989-Przymusinski #logic programming
On Constructive Negation in Logic Programming (TCP).
PODSPODS-1988-HullS #database #power of #query
On the Expressive Power of Database Queries with Intermediate Types (RH, JS), pp. 39–51.
PODSPODS-1988-Kuper #logic programming #power of #programming language #set
On the Expressive Power of Logic Programming Languages with Sets (GMK), pp. 10–14.
ICALPICALP-1988-KuceraMP
On the Learnability of DNF Formulae (LK, AMS, MP), pp. 347–361.
ICALPICALP-1988-Simon #reduction #transitive
On Minimum Flow and Transitive Reduction (KS), pp. 535–546.
ICALPICALP-1988-Wagner #strict
On Restricting the Access to an NP-Oracle (KWW), pp. 682–696.
ICALPICALP-1988-Watanabe #complexity #nondeterminism
On ≤ᴾ₁₋tt-Sparseness and Nondeterministic Complexity Classes (OW0), pp. 697–709.
ICMLML-1988-KrawchukW
On Asking the Right Questions (BJK, IHW), pp. 15–21.
ICMLML-1988-MahadevanT #learning
On the Tractability of Learning from Incomplete Theories (SM, PT), pp. 235–241.
SIGIRSIGIR-1988-Belkin #information retrieval
On the Nature and Function of Explanation in Intelligent Information Retrieval (NJB), pp. 135–145.
SIGIRSIGIR-1988-SaltonB #automation #information retrieval #using
On the Use of Spreading Activation Methods in Automatic Information Retrieval (GS, CB), pp. 147–160.
ECOOPECOOP-1988-Sakkinen #c++
On the Darker Side of C++ (MS), pp. 162–176.
POPLPOPL-1988-HorwitzPR88a #dependence #graph #representation #source code
On the Adequacy of Program Dependence Graphs for Representing Programs (SH, JP, TWR), pp. 146–157.
ICSEICSE-1988-Satyanarayanan #distributed
On the Influence of Scale in a Distributed System (MS), pp. 10–18.
DACDAC-1988-LiRS #logic
On Path Selection in Combinational Logic Circuits (WNL, SMR, SS), pp. 142–147.
PPoPPPPEALS-1988-LeeSF #implementation #multi
On the Implementation of Applicative Languages on Shared-Memory, MIMD Multiprocessors (CCL, SKS, JF), pp. 188–197.
ESOPESOP-1988-WeemeeuwBH #architecture #data flow #implementation #logic programming #programming language
On Implementing Logic Programming Languages on a Dataflow Architecture (PW, MB, MDH), pp. 359–372.
STOCSTOC-1988-HajnalMT #communication #complexity #graph
On the Communication Complexity of Graph Properties (AH, WM, GT), pp. 186–191.
STOCSTOC-1988-HalstenbergR #communication
On Different Modes of Communication (BH, RR), pp. 162–172.
STOCSTOC-1988-KalyanasundaramS #power of
On the Power of White Pebbles (BK, GS), pp. 258–266.
CADECADE-1988-KounalisR #problem #word
On Word Problems in Horn Theories (EK, MR), pp. 527–537.
CSLCSL-1988-Ambos-SpiesK #self
On Disjunctive Self-Reducibility (KAS, JK), pp. 1–13.
CSLCSL-1988-Niemela #complexity #logic #problem
On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic (IN), pp. 226–239.
CSLCSL-1988-Priese
On the Existence of Fair Schedulers (LP), pp. 272–287.
CSLCSL-1988-Wagner #automaton #logic #problem #source code
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
ICLPJICSCP-1988-WarrenHD88 #analysis #logic programming #source code
On the Practicality of Global Flow Analysis of Logic Programs (RW, MVH, SKD), pp. 684–699.
LICSLICS-1988-DeganoNM #concurrent #consistency #semantics
On the Consistency of “Truly Concurrent” Operational and Denotational Semantics (PD, RDN, UM), pp. 133–141.
LICSLICS-1988-GrabowskiH #effectiveness #hoare #logic
On the Existence of Effective Hoare Logics (MG, HH), pp. 428–435.
LICSLICS-1988-KfouryTU #polymorphism #power of #recursion
On the Computational Power of Universally Polymorphic Recursion (AJK, JT, PU), pp. 72–81.
LICSLICS-1988-Vorobyov #term rewriting
On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.
HTHT-1987-GargS #design #hypermedia #information management #re-engineering
On Designing Intelligent Hypertext Systems for Information Management in Software Engineering (PKG, WS), pp. 409–432.
PODSPODS-1987-BeeriR #power of
On the Power of Magic (CB, RR), pp. 269–284.
PODSPODS-1987-ChanH #bound #database #dependence #design #functional
On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies (EPFC, HJH), pp. 48–57.
PODSPODS-1987-Gucht #algebra #power of #relational
On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational Model (DVG), pp. 302–312.
SIGMODSIGMOD-1987-AbiteboulKG #query #representation #set
On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.
SIGMODSIGMOD-1987-StempleMS #design #feedback #transaction
On the Modes and Meaning of Feedback to Transaction Designers (DWS, SM, TS), pp. 374–386.
VLDBVLDB-1987-LenzeriniN #constraints #dependence #satisfiability
On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata (ML, PN), pp. 147–154.
ICALPICALP-1987-CaiM #complexity #graph
On the Complexity of Graph Critical Uncolorability (JyC, GEM), pp. 394–403.
ICALPICALP-1987-Diekert #concurrent #process
On the Knuth-Bendix Completion for Concurrent Processes (VD), pp. 42–53.
ICALPICALP-1987-HsiangR #equation #problem #word
On Word Problems in Equational Theories (JH, MR), pp. 54–71.
ICALPICALP-1987-IbarraJ #array #power of
On the Computing Power of One-Way Cellular Arrays (OHI, TJ), pp. 550–562.
ICALPICALP-1987-Karhumaki #formal method #roadmap
On Recent Trends in Formal Language Theory (JK), pp. 136–162.
ICALPICALP-1987-Pin #automaton #finite
On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.
ICALPICALP-1987-SchwartzS #problem
On the Bivariate Function Minimization Problem And Its Applications to Motion Planning (JTS, MS), pp. 357–363.
RTARTA-1987-BurckertHS #decidability #equation #unification
On Equational Theories, Unification and Decidability (HJB, AH, MSS), pp. 204–215.
ECOOPECOOP-1987-BlakeC #implementation #object-oriented #smalltalk
On Including Part Hierarchies in Object-Oriented Languages with an Implementation in Smalltalk (EHB, SC), pp. 41–50.
ECOOPECOOP-1987-DucournauH #algorithm #inheritance #multi #object-oriented #programming
On Some Algorithms for Multiple Inheritance in Object-Oriented Programming (RD, MH), pp. 243–252.
POPLPOPL-1987-KuoM #analysis #strict
On Strictness and its Analysis (TMK, PM), pp. 144–155.
ESECESEC-1987-GarzottoGMM #logic programming #realtime #specification #using
On the Specification of Real-Time Systems Using Logic Programming (FG, CG, DM, AM), pp. 180–190.
ICSEICSE-1987-Bjorner #development #formal method #using
On the Use of Formal Methods in Software Development (DB), pp. 17–29.
ICSEICSE-1987-CurtisKSI #modelling #process
On Building Software Process Models Under the Lamppost (BC, HK, VYS, NI), pp. 96–105.
ICSEICSE-1987-Stenning
On the Role of an Environment (VS), pp. 30–35.
DACDAC-1987-DevadasMN #abstraction #verification
On the Verification of Sequential Machines at Differing Levels of Abstraction (SD, HKTM, ARN), pp. 271–276.
DACDAC-1987-RajsumanMJ #fault #modelling
On Accuracy of Switch-Level Modeling of Bridging Faults in Complex Gates (RR, YKM, APJ), pp. 244–250.
DACDAC-1987-Wey #array #design #logic #programmable
On Yield Consideration for the Design of Redundant Programmable Logic Arrays (CLW), pp. 622–628.
DACDAC-1987-Wunderlich #random testing #testing
On Computing Optimized Input Probabilities for Random Tests (HJW), pp. 392–398.
TAPSOFTCAAP-1987-BoudolC #concurrent #partial order #semantics
On the Semantics of Concurrency: Partial Orders and Transition Systems (GB, IC), pp. 123–137.
TAPSOFTCAAP-1987-Gogolla #algebra #fault #parametricity #specification
On Parametric Algebraic Specifications with Clean Error Handling (MG), pp. 81–95.
TAPSOFTCAAP-1987-Wegener #branch #clique #complexity #source code
On the Complexity of Branching Programs and Decision Trees for Clique Functions (IW), pp. 1–12.
STOCSTOC-1987-AbadiFK
On Hiding Information from an Oracle (MA, JF, JK), pp. 195–203.
STOCSTOC-1987-KearnsLPV
On the Learnability of Boolean Formulae (MJK, ML, LP, LGV), pp. 285–295.
STOCSTOC-1987-Natarajan #learning
On Learning Boolean Functions (BKN), pp. 296–304.
CSLCSL-1987-KarpinskiBS #complexity #horn clause #quantifier
On the Computational Complexity of Quantified Horn Clauses (MK, HKB, PHS), pp. 129–137.
CSLCSL-1987-Leiss #object-oriented #programming language #type inference
On Type Inference for Object-Oriented Programming Languages (HL), pp. 151–172.
CSLCSL-1987-Speckenmeyer #backtracking #complexity #problem #satisfiability
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.
CSLCSL-1987-Spreen #nondeterminism #polynomial
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations (DS), pp. 289–303.
LICSLICS-1987-HarelPSS #semantics
On the Formal Semantics of Statecharts (DH, AP, JPS, RS), pp. 54–64.
LICSLICS-1987-SistlaZ #logic
On the Eventuality Operator in Temporal Logic (APS, LDZ), pp. 153–166.
LICSLICS-1987-Thomas #first-order #infinity #logic
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
ICLPSLP-1987-Subrahmanian87 #logic programming #semantics #source code
On the Semantics of Quantitative Logic Programs (VSS), pp. 173–182.
PODSPODS-1986-ChanA
On the Properties and Characterization of Connection-tap-free Schemes (EPFC, PA), pp. 140–147.
PODSPODS-1986-SaccaZ #database #implementation #logic #query
On the Implementation of a Simple Class of Logic Queries for Databases (DS, CZ), pp. 16–23.
PODSPODS-1986-SagivS86a #finite
On Finite FD-Acyclicity (YS, OS), pp. 173–182.
PODSPODS-1986-Vardi #database
On the Integrity of Databases with Incomplete Information (MYV), pp. 252–266.
SIGMODSIGMOD-1986-Bocca #evaluation
On the Evaluation Strategy of EDUCE (JBB), pp. 368–378.
VLDBVLDB-1986-ArisawaM #dependence
On the Properties of Extended Inclusion Dependencies (HA, TM), pp. 449–456.
VLDBVLDB-1986-Ioannidis #relational #transitive
On the Computation of the Transitive Closure of Relational Operators (YEI), pp. 403–411.
VLDBVLDB-1986-Yokomori #database #logic #query
On Analogical Query Processing in Logic Database (TY), pp. 376–383.
VLDBVLDB-1986-YuCDI #multi
On Affinity Based Routing in Multi-System Data Sharing (PSY, DWC, DMD, BRI), pp. 249–256.
ICALPICALP-1986-BookORW #exponential
On Exponential Lowness (RVB, PO, DAR, OW), pp. 40–49.
ICALPICALP-1986-GoralcikK #automaton #word
On Discerning Words by Automata (PG, VK), pp. 116–122.
ICALPICALP-1986-HermannP #algorithm
On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.
ICALPICALP-1986-Metivier #commutative #monad #set
On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
ICALPICALP-1986-Niwinski #fixpoint
On Fixed-Point Clones (DN), pp. 464–473.
ICALPICALP-1986-RosierY #complexity #concurrent #finite #probability #source code #termination
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
LISPLFP-1986-LeeP #implementation #lisp #semantics #using
On the Use of LISP in Implementing Denotational Semantics (PL, UFP), pp. 233–248.
ICGTGG-1986-Brandenburg #graph grammar #order
On Partially Ordered Graph Grammars (FJB), pp. 99–111.
ICGTGG-1986-Courcelle86a #graph #higher-order #monad #set
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
ICGTGG-1986-HotzKM #algebra #equation #network #recursion
On Network Algebras and Recursive Equations (GH, RK, PM), pp. 250–261.
SIGIRSIGIR-1986-WongZRW #query
On Extending the Vector Space Model for Boolean Query Processing (SKMW, WZ, VVR, PCNW), pp. 175–185.
DACDAC-1986-JustKJ #layout #problem #standard
On the relative placement and the transportation problem for standard-cell layout (KMJ, JMK, FMJ), pp. 308–313.
DACDAC-1986-WunderlichR #fault #modelling
On fault modeling for dynamic MOS circuits (HJW, WR), pp. 540–546.
STOCSTOC-1986-GalilKS #graph #nondeterminism #simulation #turing machine
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
ICLPICLP-1986-MannilaU86 #complexity #sequence #unification
On the Complexity of Unification Sequences (HM, EU), pp. 122–133.
ICLPICLP-1986-MartelliR86 #logic programming #semantics
On the Semantics of Logic Programing Languages (AM, GR), pp. 327–334.
LICSLICS-1986-ChouK #geometry #proving #theorem proving
On Mechanical Theorem Proving in Minkowskian Plane Geometry (SCC, HPK), pp. 187–192.
LICSLICS-1986-MakowskyS #equivalence #higher-order #semantics #standard #verification
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems (JAM, IS), pp. 293–300.
LICSLICS-1986-Statman #combinator #problem
On Translating λ Terms into Combinators; The Basis Problem (RS), pp. 378–382.
PODSPODS-1985-CasanovaMT #correctness
On the Correctness of a Local Storage Subsystem (MAC, AVM, LT), pp. 123–134.
PODSPODS-1985-OzsoyogluM #optimisation #query
On Optimizing Summary-Table-by-Example Queries (GÖ, VM), pp. 38–50.
PODSPODS-1985-Ramarao #commit #complexity #protocol
On the Complexity of Commit Protocols (KVSR), pp. 235–244.
PODSPODS-1985-Sagiv85a #strict
On Computing Restricted Projections of Representative Instances (YS), pp. 171–180.
SIGMODSIGMOD-1985-CliffordT #algebra #database #relational
On An Algebra For Historical Relational Databases: Two Views (JC, AUT), pp. 247–265.
SIGMODSIGMOD-1985-Kung #constraints #database #verification
On Verification of Database Temporal Constraints (DCK), pp. 169–179.
SIGMODSIGMOD-1985-KuperV #logic #power of
On the Expressive Power of the Logical Data Model (GMK, MYV), pp. 180–187.
VLDBVLDB-1985-Kiessling #correlation #performance #query #semantics
On Semantic Reefs and Efficient Processing of Correlation Queries with Aggregates (WK), pp. 241–250.
ICALPICALP-1985-BucherEH
On Total Regulators Generated by Derivation Relations (WB, AE, DH), pp. 71–79.
ICALPICALP-1985-HartmanisI #problem
On Complete Problems for NP∩CoNP (JH, NI), pp. 250–259.
ICALPICALP-1985-Jung #probability
On Probabilistic Time and Space (HJ), pp. 310–317.
ICALPICALP-1985-Keranen #morphism #word
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.
ICALPICALP-1985-SippuS #algorithm #design #performance #relational #using
On the Use of Relational Expressions in the Design of Efficient Algorithms (SS, ESS), pp. 456–464.
ICALPICALP-1985-VarmanR #array #matrix #multi #using
On Matrix Multiplication Using Array Processors (PJV, IVR), pp. 487–496.
SIGIRSIGIR-1985-Jochum #query #retrieval #testing
On Retrieval Tests with an Inhomogeneous Query Collection (FJ), pp. 215–224.
POPLPOPL-1985-FerranteM #parallel
On Linearizing Parallel Code (JF, MM), pp. 179–189.
ICSEICSE-1985-Lee #execution #modelling #prototype #rule-based
On Executable Models for Rule-Based Prototyping (SL), pp. 210–215.
TAPSOFTCAAP-1985-AstesianoMRW #algebra #concurrent #specification
On the Parameterized Algebraic Specification of Concurrent Systems (EA, GM, GR, MW), pp. 342–358.
TAPSOFTCAAP-1985-PoigneV #data type #implementation #programming language
On the Implementation of Abstract Data Types by Programming Language Constructs (AP, JV), pp. 388–402.
TAPSOFTCAAP-1985-ProtasiT #random
On the Maximum Size of Random Trees (MP, MT), pp. 139–144.
TAPSOFTCAAP-1985-SannellaT #algebra #equivalence #specification
On Observational Equivalence and Algebraic Specification (DS, AT), pp. 308–322.
TAPSOFTCSE-1985-Floyd #development #formal method
On the Relevance of Formal Methods to Software Development (CF), pp. 1–11.
STOCSTOC-1985-BollobasS #algorithm #behaviour #set
On the Expected Behaviour of Disjoint Set Union Algorithms (BB, IS), pp. 224–231.
STOCSTOC-1985-GoodmanGMM
On the Stability of the Ethernet (JG, AGG, NM, PM), pp. 379–387.
ICLPSLP-1985-OKeefe85 #prolog #tool support
On the Treatment of Cuts in Prolog Source-Level Tools (RAO), pp. 68–72.
PODSPODS-1984-DAtriM #database #design #recognition
On the Recognition and Design of Acyclic Databases (AD, MM), pp. 1–8.
PODSPODS-1984-GrahamV #axiom #complexity #consistency #database
On the Complexity and Axiomatizability of Consistent Database States (MHG, MYV), pp. 281–289.
PODSPODS-1984-GyssensP #composition #dependence
On the Decomposition of Join Dependencies (MG, JP), pp. 143–152.
PODSPODS-1984-ImielinskiS #database
On Lossless Transformation of Database Schemes not Necessarily Satisfying Universal Instance Assumption (TI, NS), pp. 258–265.
PODSPODS-1984-KuperUV #database #equivalence #logic
On the Equivalence of Logical Databases (GMK, JDU, MYV), pp. 221–228.
PODSPODS-1984-Lipski #algebra #relational
On Relational Algebra with Marked Nulls (WLJ), pp. 201–203.
PODSPODS-1984-OzsoyogluC #query
On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (ZMÖ, EC), pp. 133–142.
SIGMODSIGMOD-1984-KellerU #database #independence
On Complementary and Independent Mappings on Databases (AMK, JDU), pp. 143–148.
ICALPICALP-1984-Abdallah #infinity #logic programming
On the Interpretation of Infinite Computations in Logic Programming (MANA), pp. 358–370.
ICALPICALP-1984-GoltzM #petri net
On the Relationship of CCS and Petri Nets (UG, AM), pp. 196–208.
ICALPICALP-1984-Jung #complexity #matrix #performance #probability #problem
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (HJ), pp. 281–291.
ICALPICALP-1984-Karhumaki
On Three-Element Codes (JK), pp. 292–302.
POPLPOPL-1984-Grabowski #logic #programming
On Relative Completeness of Programming Logics (MG), pp. 258–261.
ICSEICSE-1984-MaibaumT #what
On What Exactly Is Going On When Software Is Developed Step-by-Step (TSEM, WMT), pp. 528–533.
DACDAC-1984-SastryP #logic #slicing
On the relation between wire length distributions and placement of logic on master slice ICs (SS, ACP), pp. 710–711.
STOCSTOC-1984-BussS #graph
On the Pagenumber of Planar Graphs (JFB, PWS), pp. 98–100.
STOCSTOC-1984-ColeSY #problem
On k-hulls and Related Problems (RC, MS, CKY), pp. 154–166.
STOCSTOC-1984-DolevHS
On the Possibility and Impossibility of Achieving Clock Synchronization (DD, JYH, HRS), pp. 504–511.
STOCSTOC-1984-GoldbergM #problem
On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.
STOCSTOC-1984-KlawePPY #strict
On Monotone Formulae with Restricted Depth (MMK, WJP, NP, MY), pp. 480–487.
STOCSTOC-1984-Manber #concurrent #information management #maintenance
On Maintaining Dynamic Information in a Concurrent Environment (UM), pp. 273–278.
STOCSTOC-1984-SharirS
On Shortest Paths in Polyhedral Spaces (MS, AS), pp. 144–153.
STOCSTOC-1984-SlotB #performance
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space (CFS, PvEB), pp. 391–400.
ICLPILPC-1984-Dahl84 #semiparsing
On Gapping Grammars (VD), pp. 77–88.
ICLPSLP-1984-BarbutiBLM84 #functional #integration #logic programming
On the Integration of Logic Programming and Functional Programming (RB, MB, GL, MM), pp. 160–166.
ICLPSLP-1984-Carlsson84 #functional #implementation #programming #prolog
On Implementing Prolog in Functional Programming (MC), pp. 154–159.
PODSPODS-1983-FaginUV #database #semantics
On the Semantics of Updates in Databases (RF, JDU, MYV), pp. 352–365.
PODSPODS-1983-Sacca #database #recognition
On the Recognition of Coverings of Acyclic Database Hypergraphs (DS), pp. 297–304.
SIGMODSIGMOD-1983-Wright #database
On Merging Partitioned Databases (DDW), pp. 6–14.
SIGMODSIGMOD-1983-YuC #database #design #distributed #query
On the Design of a Query Processing Strategy in a Distributed Database Environment (CTY, CCC), pp. 30–39.
ICALPICALP-1983-Abramsky #multi #semantics
On Semantic Foundations for Applicative Multiprogramming (SA), pp. 1–14.
ICALPICALP-1983-Brookes #csp
On the Relationship of CCS and CSP (SDB), pp. 83–96.
ICALPICALP-1983-DarondeauK #parallel #semantics
On the Observational Semantics of Fair Parallelism (PD, LK), pp. 147–159.
ICALPICALP-1983-Dehne #algorithm #diagrams #nearest neighbour
On O(N^4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching (FKHAD), pp. 160–172.
ICALPICALP-1983-EdelsbrunnerW #set
On the Number of Equal-Sized Semispaces of a Set of Points in the Plane (HE, EW), pp. 182–187.
ICALPICALP-1983-LatteuxL #composition #morphism
On the Composition of Morphisms and Inverse Morphisms (ML, JL), pp. 420–432.
ICALPICALP-1983-LescanneS #case study #data type
On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.
ICALPICALP-1983-RestM #complexity #finite
On the Group Complexity of a Finite Language (EBLR, SWM), pp. 433–444.
ICALPICALP-1983-Vitanyi #simulation
On the Simulation of Many Storage Heads by a Single One (PMBV), pp. 687–694.
POPLPOPL-1983-Wegner #abstraction #ada #unification
On the Unification of Data and Program Abstraction in Ada (PW), pp. 256–264.
RERE-1983-Partsch #algebra #requirements #using
On the Use of Algebraic Methods for Formal Requirements Definitions (HP), pp. 138–158.
DACDAC-1983-ChiangV #detection #fault #logic #network
On fault detection in CMOS logic networks (KWC, ZGV), pp. 50–56.
STOCSTOC-1983-Adleman
On Breaking Generalized Knapsack Public Key Cryptosystems (LMA), pp. 402–412.
STOCSTOC-1983-AhoUY
On Notions of Information Transfer in VLSI Circuits (AVA, JDU, MY), pp. 133–139.
STOCSTOC-1983-Ben-OrCS #encryption #security
On the Cryptographic Security of Single RSA Bits (MBO, BC, AS), pp. 421–430.
STOCSTOC-1983-DriscollF #permutation
On the Diameter of Permutation Groups (JRD, MLF), pp. 152–160.
STOCSTOC-1983-Pnueli #algorithm #probability
On the Extremely Fair Treatment of Probabilistic Algorithms (AP), pp. 278–290.
PODSPODS-1982-PapadimitriouK #concurrent #multi
On Concurrency Control by Multiple Versions (CHP, PCK), pp. 76–82.
PODSPODS-1982-Rissanen #database
On Equivalences of Database Schemes (JR), pp. 23–26.
SIGMODSIGMOD-1982-HaskinL #database #relational
On Extending the Functions of a Relational Database System (RLH, RAL), pp. 207–212.
SIGMODSIGMOD-1982-Kuss #database #distributed
On Totally Ordering Checkpoints in Distributed Data Bases (HK), p. 174.
VLDBVLDB-1982-BancilhonRS
On Line Processing of Compacted Relations (FB, PR, MS), pp. 263–269.
VLDBVLDB-1982-DoschMW #algebra #database #specification
On the Algebraic Specification of Databases (WD, GM, MW), pp. 370–385.
ICALPICALP-1982-BermanHT #logic #nondeterminism #power of
On the Power of Nondeterminism in Dynamic Logic (PB, JYH, JT), pp. 48–60.
ICALPICALP-1982-Blum #context-free grammar #power of
On the Power of Chain Rules in Context Free Grammars (NB), pp. 72–82.
ICALPICALP-1982-Culik #testing
On Test Sets and the Ehrenfeucht Conjecture (KCI), pp. 128–140.
ICALPICALP-1982-DurisG #automaton #bound
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.
ICALPICALP-1982-Karhumaki #equivalence #problem
On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.
ICALPICALP-1982-Reif #parallel #power of #probability
On the Power of Probabilistic Choice in Synchronous Parallel Computations (JHR), pp. 442–450.
ICALPICALP-1982-Sipser #set
On Relativization and the Existence of Complete Sets (MS), pp. 523–531.
ICGTGG-1982-HabelK
On context-free gragh languages generated by edge replacement (AH, HJK), pp. 143–158.
SIGIRSIGIR-1982-Biller #architecture #database #information retrieval
On the Architecture of a System Integrating Data Base Management and Information Retrieval (HB), pp. 80–97.
POPLPOPL-1982-ClarkeGH #axiom #effectiveness #hoare #logic
On Effective Axiomatizations of Hoare Logics (EMC, SMG, JYH), pp. 309–321.
POPLPOPL-1982-Cooper #database #power of #query #relational
On the Expressive Power of Query Languages for Relational Databases (ECC), pp. 361–365.
POPLPOPL-1982-Critcher #information management
On the Ability of Structures to Store and Access Information (AC), pp. 366–378.
POPLPOPL-1982-Pratt #composition #process
On the Composition of Processes (VRP), pp. 213–223.
ASPLOSASPLOS-1982-Reed #memory management
On a General Property of Memory Mapping Tables (KR), pp. 81–86.
DACDAC-1982-MalingMH
On finding most optimal rectangular package plans (KM, SHM, WRH), pp. 663–670.
DACDAC-1982-Pinter
On routing two-point nets across a channel (RYP), pp. 894–902.
DACDAC-1982-SyedGB
On routing for custom integrated circuits (ZAS, AEG, MAB), pp. 887–893.
STOCSTOC-1982-Bar-YehudaE #approximate #graph
On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.
STOCSTOC-1982-Greenberg #communication #complexity
On the Time Complexity of Broadcast Communication Schemes (AGG), pp. 354–364.
STOCSTOC-1982-Kurtz #random
On the Random Oracle Hypothesis (SAK), pp. 224–230.
CADECADE-1982-Minker #database
On Indefinite Databases and the Closed World Assumption (JM), pp. 292–308.
ICLPILPC-1982-Pique82 #natural language #representation #semantics
On a Semantic Representation of Natural Language Sentences (JFP), pp. 215–223.
SIGMODSIGMOD-1981-Papadimitriou #power of
On the Power of Locking (CHP), pp. 148–154.
SIGMODSIGMOD-1981-SwartwoutL #requirements
On the Requirements of Navigational Relationship Representations (DES, JCL), pp. 1–9.
VLDBVLDB-1981-Brodie #behaviour #database #modelling #semantics
On Modelling Behavioural Semantics of Databases (MLB), pp. 32–42.
VLDBVLDB-1981-ImielinskiL #database #relational #representation
On Representing Incomplete Information in a Relational Data Base (TI, WLJ), pp. 388–397.
ICALPICALP-1981-EhrenfeuchtR #problem
On the (Generalized) Post Correspondence Problem with Lists of Length 2 (AE, GR), pp. 408–416.
ICALPICALP-1981-IbarraLM #complexity
On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.
ICALPICALP-1981-Shamir #encryption #generative #pseudo #sequence
On the Generation of Cryptographically Strong Pseudo-Random Sequences (AS), pp. 544–550.
ICALPICALP-1981-SippuS #lalr #testing
On LALR(1) Testing (SS, ESS), pp. 208–217.
ICALPICALP-1981-Ukkonen #bound #parsing
On Size Bounds for Deterministic Parsers (EU), pp. 218–228.
ICALPICALP-1981-Welzl
On the Density of Color-Families (EW), pp. 68–72.
SIGIRSIGIR-1981-Stirling #algorithm #documentation #information retrieval #ranking
On the Limitations of Document Ranking Algorithms in Information Retrieval (KHS), pp. 63–65.
POPLPOPL-1981-LehmannR #distributed #problem #symmetry
On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem (DJL, MOR), pp. 133–138.
ICSEICSE-1981-Forman #traversal
On the Time Overhead of Counters and Traversal Markers (IRF), pp. 164–169.
DACDAC-1981-Akers #algorithm #linear #using
On the use of the linear assignment algorithm in module placement (SBA), pp. 137–144.
DACDAC-1981-Berman #comparison #logic
On logic comparison (LB), pp. 854–861.
DACDAC-1981-McFarland #automation #correctness #design #optimisation #proving
On proving the correctness of optimizing transformations in a digital design automation system (MCM), pp. 90–97.
DACDAC-1981-TsukiyamaKS #multi #problem
On the layering problem of multilayer PWB wiring (ST, ESK, IS), pp. 738–745.
STOCSTOC-1981-Parisi-Presicce #algebra
On the Faithful Regular Extensions of Iterative Algebras (FPP), pp. 368–374.
STOCSTOC-1981-Yao #parallel #problem
On the Parallel Computation for the Knapsack Problem (ACCY), pp. 123–127.
SIGMODSIGMOD-1980-BancilhonS #database #design #relational
On Designing an I/O Processor for a Relational Data Base Machine (FB, MS), p. 93–?.
SIGMODSIGMOD-1980-KwongW #concurrent
On B-Trees: Routing Schemes and Concurrency (YSK, DW), pp. 207–211.
VLDBVLDB-1980-MenasceL #component #database #design #distributed #reliability
On the Design of a Reliable Storage Component for Distributed Database Management Systems (DAM, OEL), pp. 365–375.
VLDBVLDB-1980-Walker #database #retrieval #scalability
On Retrieval from a Small Version of a Large Data Base (AW), pp. 47–54.
ICALPICALP-1980-FlajoletS #algorithm #analysis
On the Analysis of Tree-Matching Algorithms (PF, JMS), pp. 208–219.
ICALPICALP-1980-HennessyM #concurrent #nondeterminism
On Observing Nondeterminism and Concurrency (MH, RM), pp. 299–309.
ICALPICALP-1980-LucaR #testing
On Some Properties of Local Testability (AdL, AR), pp. 385–393.
ICALPICALP-1980-RaihaU #multi
On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators (KJR, EU), pp. 500–511.
ICALPICALP-1980-Shamir #commutative #encryption #power of
On the Power of Commutativity in Cryptography (AS), pp. 582–595.
ICALPICALP-1980-Snir #complexity
On the Size Complexity of Monotone Formulas (MS), pp. 621–631.
ICALPICALP-1980-Vitanyi #power of #realtime #specification
On the Power of Real-Time Machines Under Varying Specifications (PMBV), pp. 658–671.
LISPLISP-1980-EmanuelsonH #compilation #embedded #lisp
On Compiling Embedded Languages in LISP (PE, AH), pp. 208–215.
POPLPOPL-1980-GabbayPSS
On the Temporal Basis of Fairness (DMG, AP, SS, JS), pp. 163–173.
POPLPOPL-1980-Musser #data type #induction #proving
On Proving Inductive Properties of Abstract Data Types (DRM), pp. 154–162.
POPLPOPL-1980-Pratt #specification #verification
On Specifying Verifiers (VRP), pp. 106–116.
CCSDCG-1980-Donzeau-GougeKL #ada
On the formal definition of ADA (VDG, GK, BL), pp. 475–489.
CCSDCG-1980-Madsen #attribute grammar #semantics
On defining semantics by means of extended attribute grammars (OLM), pp. 259–299.
CCSDCG-1980-Tienari #attribute grammar
On the definition of attribute grammar (MT), pp. 408–414.
STOCSTOC-1980-GuibasY #set
On Translating a Set of Rectangles (LJG, FFY), pp. 154–160.
STOCSTOC-1980-Hong #complexity #problem
On Some Deterministic Space Complexity Problems (JWH), pp. 310–317.
STOCSTOC-1980-Plaisted #independence
On the Distribution of Independent Formulae of Number Theory (DAP), pp. 39–44.
VLDBVLDB-1979-Bubenko #comprehension #concept #design #modelling
On the Role of “Understanding Models” in Conceptual Schema Design (JABJ), pp. 129–139.
VLDBVLDB-1979-KungR #concurrent
On Optimistic Methods for Concurrency Control (HTK, JTR), p. 351.
VLDBVLDB-1979-Svensson #order #performance #query
On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.
ICALPICALP-1979-Culik #product line
On the Homomorphic Characterizations of Families of Languages (KCI), pp. 161–170.
ICALPICALP-1979-Hartmanis
On the Succintness of Different Representations of Languages (JH), pp. 282–288.
ICALPICALP-1979-Kemp #distributed #stack
On the Average Stack Size of Regularly Distributed Binary Trees (RK), pp. 340–355.
ICALPICALP-1979-KowalkV #parallel #reduction #source code
On Reductions of Parallel Programs (WK, RV), pp. 356–369.
ICALPICALP-1979-KuichPU
On the Height of Derivation Trees (WK, HP, FJU), pp. 370–384.
ICALPICALP-1979-MonienS #nondeterminism #turing machine
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.
ICALPICALP-1979-Ruzzo #complexity #context-free grammar #parsing #recognition
On the Complexity of General Context-Free Language Parsing and Recognition (WLR), pp. 489–497.
ICALPICALP-1979-Schonhage #power of #random
On the Power of Random Access Machines (AS), pp. 520–529.
ICALPICALP-1979-SippuS #ll #parsing
On Constructing LL(k) Parsers (SS, ESS), pp. 585–595.
SIGIRSIGIR-1979-Croft #documentation #implementation #modelling #retrieval
On the Implementation of Some Models of Document Retrieval (WBC), pp. 71–77.
PLDISCC-1979-LeBlancF #compilation #implementation
On implementing separate compilation in block-structured languages (RJL, CNF), pp. 139–143.
ICSEICSE-1979-Bayer #database
On Synchronization and Recovery in Database Systems (RB), pp. 423–424.
ICSEICSE-1979-DAgapayeff #framework #platform
On Microprocessors: A Platform for True Program Portability with Examples from Microcobal (AD), pp. 332–339.
ICSEICSE-1979-HutchingsMETW #re-engineering
On CADES-Software Engineering in Practice (AFH, RWM, AEE, BRT, PNW), pp. 136–144.
ICSEICSE-1979-McKeeman #overview #perspective
On An Overview (WMM), p. 340.
ICSEICSE-1979-MorrisseyW #perspective #re-engineering
On Software Engineering — An Economic Perspective (JMM, LSYW), pp. 412–422.
ICSEICSE-1979-RamamoorthyBFMNS #approach #development #validation
On A Systematic Approach to the Development and Validation of Critical Software for Nuclear Power Plants (CVR, FBB, JMF, YKRM, CWN, KS), pp. 231–240.
ICSEICSE-1979-Vick #past present future #re-engineering #tool support
On Software Engineering Tools: Past, Present and Future (CRV), p. 52.
STOCSTOC-1979-FilottiMR #graph
On Determining the Genus of a Graph in O(v^O(g)) Steps (ISF, GLM, JHR), pp. 27–37.
STOCSTOC-1979-JaJa #commutative #complexity
On the Complexity of Bilinear Forms with Commutativity (JJ), pp. 197–208.
STOCSTOC-1979-Kosaraju #multi #problem
On a Multidimensional Search Problem (SRK), pp. 67–73.
STOCSTOC-1979-Long #polynomial
On γ-Reducibility versus Polynomial Time Many-One Reducibility (TJL), pp. 278–287.
STOCSTOC-1979-MeyerW #logic #power of
On the Expressive Power of Dynamic Logic (ARM, KW), pp. 167–175.
STOCSTOC-1979-Shamir #complexity
On the Cryptocomplexity of Knapsack Systems (AS), pp. 118–129.
VLDBVLDB-1978-Batory
On Searching Transposed Files (DSB), p. 488.
VLDBVLDB-1978-Chang #database #relational
On Bubble Memories and Relational Data Base (HC), pp. 207–229.
VLDBVLDB-1978-DayalB #relational
On the Updatability of Relational Views (UD, PAB), pp. 368–377.
VLDBVLDB-1978-Manola #database #framework
On Relating the CODASYL Database Languages and the ANSI/SPARC Framework (FM), p. 132.
ICALPICALP-1978-DammF #power of #recursion #self
On the Power of Self-Application and Higher Type-Recursion (WD, EF), pp. 177–191.
ICALPICALP-1978-Galil #algorithm #string
On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm (ZG), pp. 241–250.
ICALPICALP-1978-Nijholt #parsing
On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.
ICALPICALP-1978-Saarinen #attribute grammar #performance
On Constructing Efficient Evaluators for Attribute Grammars (MS), pp. 382–397.
FMVDM-1978-Lucas #formal method #programming language
On the Formalization of Programming Languages: Early History and Main Approaches (PL), pp. 1–23.
ICGTGG-1978-Ollongren #graph grammar #multi
On Multilevel-Graph Grammars (AO), pp. 341–349.
DACDAC-1978-Haims #2d #problem
On the optimum two-dimensional allocation problem (MJH), pp. 298–304.
STOCSTOC-1978-BrussM #formal method
On Time-Space Classes and Their Relation to the Theory of Real Addition (ARB, ARM), pp. 233–239.
STOCSTOC-1978-Hyafil #evaluation #parallel
On the Parallel Evaluation of Multivariate Polynomials (LH), pp. 193–195.
STOCSTOC-1978-KirkpatrickH #problem
On the Completeness of a Generalized Matching Problem (DGK, PH), pp. 240–245.
STOCSTOC-1978-Lewis #complexity #problem
On the Complexity of the Maximum Subgraph Problem (JML), pp. 265–274.
STOCSTOC-1978-Miller #morphism
On the n^log n Isomorphism Technique: A Preliminary Report (GLM), pp. 51–58.
STOCSTOC-1978-MillerY #parallel
On Formulating Simultaneity for Studying Parallelism and Synchronization (REM, CKY), pp. 105–113.
VLDBVLDB-1977-Lipski #database #semantics
On Semantic Issues Connected with Incomplete Information Data Bases (WLJ), p. 491.
ICALPICALP-1977-AusielloDP #combinator #problem #reduction
On the Structure of Combinatorial Problems and Structure Preserving Reductions (GA, AD, MP), pp. 45–60.
ICALPICALP-1977-BookY #bound #power of
On the Computational Power of Reversal-Bounded Machines (RVB, CKY), pp. 111–119.
ICALPICALP-1977-Courcelle
On the Definition of Classes of Interpretations (BC), pp. 554–569.
ICALPICALP-1977-DikovskyM #ambiguity #context-free grammar
On Three Types of Unambiguity of Context-Free Languages (AJD, LSM), pp. 193–205.
ICALPICALP-1977-Erni #complexity
On the Time and Tape Complexity of Hyper(1)-AFL’s (WJE), pp. 230–243.
ICALPICALP-1977-JanssenB
On the Proper Treatment or Referencing, Dereferencing and Assignment (TMVJ, PvEB), pp. 282–300.
ICALPICALP-1977-Roever #backtracking #fixpoint
On Backtracking and Greatest Fixpoints (WPdR), pp. 412–429.
ICALPICALP-1977-Simon #difference
On the Difference Between One and Many (JS), pp. 480–491.
ICALPICALP-1977-SippuS #fault #parsing
On Defining Error Recovery in Context-Free Parsing (SS, ESS), pp. 492–503.
POPLPOPL-1977-Nijholt #recursion
On the Covering of Left Recursive Grammars (AN), pp. 86–96.
SOSPSOSP-1977-Snyder #analysis #synthesis
On the Synthesis and Analysis of Protection Systems (LS), pp. 141–150.
STOCSTOC-1977-Constable #formal method #logic #programming
On the Theory of Programming Logics (RLC), pp. 269–285.
STOCSTOC-1977-Paul
On Time Hierarchies (WJP), pp. 218–222.
STOCSTOC-1977-Simon
On Feasible Numbers (JS), pp. 195–207.
VLDBVLDB-J-1975-BayerM76 #random
On the Encipherment of Search Trees and Random Access Files (RB, JKM), pp. 37–52.
ICALPICALP-1976-Galil #integer #programming #proving #theorem proving
On Enumeration Procedures for Theorem Proving and for Integer Programming (ZG), pp. 355–381.
ICALPICALP-1976-Greif #proving #source code
On Proofs of Programs for Synchronization (IG), pp. 494–507.
ICALPICALP-1976-Leeuwen
On the Construction of Huffman Trees (JvL), pp. 382–410.
ICALPICALP-1976-Linna #context-free grammar
On ω-sets Associated with Context-Free Languages (ML), pp. 1–19.
ICALPICALP-1976-Restivo #product line
On a Family of Codes Related to Factorization of Cyclotomic Polynomials (AR), pp. 38–44.
POPLPOPL-1976-LaLonde #lr #parsing #reduction
On Directly Constructing LR(k) Parsers Without Chain Reductions (WRL), pp. 127–133.
ICSEICSE-1976-BalzerGW #approach #implementation #programming
On the Transformational Implementation Approach to Programming (RB, NMG, DSW), pp. 337–344.
ICSEICSE-1976-GoudaM #analysis #design #modelling #protocol
On the Modelling, Analysis and Design of Protocols — A Special Class of Software Structures (MGG, EGM), pp. 256–262.
ICSEICSE-1976-RamamoorthyHC #automation #generative #testing
On the Automated Generation of Program Test Data (CVR, SBFH, WTC), p. 636.
ICSEICSE-1976-Rubin #network #reliability
On Reliable Topologies for Computer Networks (IR), pp. 263–267.
ICSEICSE-1976-Smith #effectiveness #in memory #memory management #set
On the Effectiveness of Set Associative Page Mapping and Its Application to Main Memory Management (AJS), pp. 286–292.
DACDAC-1976-Cleemput #aspect-oriented #layout #problem
On the topological aspects of the circuit layout problem (WMvC), pp. 441–450.
STOCSTOC-1976-Doeppner #abstraction #parallel #source code
On Abstractions of Parallel Programs (TWDJ), pp. 65–72.
STOCSTOC-1976-GrahamHR #context-free grammar #polynomial #recognition
On Line Context Free Language Recognition in Less than Cubic Time (SLG, MAH, WLR), pp. 112–120.
STOCSTOC-1976-HartmanisB #morphism #set
On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
STOCSTOC-1976-Kosaraju
On Structuring Flowcharts (SRK), pp. 101–111.
STOCSTOC-1976-Sudborough #automaton #context-free grammar #multi #power of
On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.
STOCSTOC-1976-Yao #algorithm #behaviour #set
On the Average Behavior of Set Merging Algorithms (ACCY), pp. 192–195.
SIGMODSIGMOD-1975-SchmidS #relational #semantics
On the Semantics of the Relational Data Model (HAS, JRS), pp. 211–223.
VLDBVLDB-1975-BayerM #random
On the Encipherment of Search Trees and Random Access Files (RB, JKM), p. 452.
VLDBVLDB-1975-Manacher #database #implementation #performance #relational #scalability
On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer (GKM), pp. 175–201.
VLDBVLDB-1975-ShoshaniB #database #implementation #logic
On the Implementation of a Logical Data Base Converter (AS, KB), pp. 529–531.
POPLPOPL-1975-HuntSU #complexity #lr #testing
On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
POPLPOPL-1975-JazayeriOR #attribute grammar #complexity
On the Complexity of the Circularity Test for Attribute Grammars (MJ, WFO, WCR), pp. 119–129.
DACDAC-1975-CleemputAL #automation #design
On the status of design automation in canada (WMvC, RFA, JGL), pp. 1–7.
SOSPSOSP-1975-HarrisonRU #operating system
On Protection in Operating System (MAH, WLR, JDU), pp. 14–24.
STOCSTOC-1975-EhrenfeuchtR #formal method #predict
On (Un)predictability of Formal Languages (AE, GR), pp. 117–120.
STOCSTOC-1975-EhrenfeuchtR75a #combinator #interactive
On the (Combinatorial) Structure of L Languages without Interactions (AE, GR), pp. 137–144.
STOCSTOC-1975-Galil #bound #complexity
On the Validity and Complexity of Bounded Resolution (ZG), pp. 72–82.
STOCSTOC-1975-HuntS #complexity #problem
On the Complexity of Grammar and Related Problems (HBHI, TGS), pp. 54–65.
STOCSTOC-1975-Skyum #parallel
On Decomposing Languages Defined by Parallel Devices (SS), pp. 121–125.
STOCSTOC-1975-Valiant #bound #complexity
On Non-linear Lower Bounds in Computational Complexity (LGV), pp. 45–53.
STOCSTOC-1975-Wagner #complexity #problem #string
On the Complexity of the Extended String-to-String Correction Problem (RAW), pp. 218–223.
STOCSTOC-1975-Yao #polynomial
On Computing the Minima of Quadratic Forms (ACCY), pp. 23–26.
SIGMODSIGFIDET-1974-Minsky #database #interactive
On Interaction with Data Bases (NHM), pp. 51–62.
ICALPICALP-1974-Book #complexity
On the Structure of Complexity Classes (RVB), pp. 437–445.
ICALPICALP-1974-FlajoletS #set
On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.
ICALPICALP-1974-HartmanisB
On Simple Goedel Numberings and Translations (JH, TPB), pp. 301–316.
ICALPICALP-1974-Kandzia #algol #source code
On the Most Recent Property of Algol-Like Programs (PK), pp. 97–111.
ICALPICALP-1974-Pager #lr #parsing
On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.
ICALPICALP-1974-Reynolds #continuation #semantics
On the Relation between Direct and Continuation Semantics (JCR), pp. 141–156.
ICALPICALP-1974-Schnorr #information management
On Maximal Merging of Information in Boolean Computations (CPS), pp. 294–300.
STOCSTOC-1974-BorodinC
On the Number of Additions to Compute Specific Polynomials (AB, SAC), pp. 342–347.
STOCSTOC-1974-CookR #calculus #proving
On the Lengths of Proofs in the Propositional Calculus (SAC, RAR), pp. 135–148.
STOCSTOC-1974-DobkinL
On Some Generalizations of Binary Search (DPD, RJL), pp. 310–316.
STOCSTOC-1974-Rackoff #complexity
On the Complexity of the Theories of Weak Direct Products: A Preliminary Report (CR), pp. 149–160.
SIGIRSIGIR-1973-SaltonY #effectiveness #information retrieval
On the Construction of Effective Vocabularies for Information Retrieval (GS, CTY), pp. 48–60.
POPLPOPL-1973-Beech #pl-i #standard
On the Definitional Method of Standard PL/1 (DB), pp. 87–94.
POPLPOPL-1973-Chandra #commutative #problem
On the Decision Problems of Program Schemas with Commutative and Invertable Functions (AKC), pp. 235–242.
SOSPSOSP-1973-ArvindKS #generative #process #string
On Reference String Generation Processes (A, RYK, ES), pp. 80–87.
SOSPSOSP-1973-Ellis
On the Propability of Deadline in Computer Systems (CAE), pp. 88–95.
SOSPSOSP-1973-Stephenson
On the Structure and Control of Commands (CJS), pp. 22–26.
STOCSTOC-1973-AhoHU
On Finding Lowest Common Ancestors in Trees (AVA, JEH, JDU), pp. 253–265.
STOCSTOC-1973-BrockettD #evaluation #set
On the Optimal Evaluation of a Set of Bilinear Forms (RWB, DPD), pp. 88–95.
STOCSTOC-1973-Hunt #complexity
On the Time and Tape Complexity of Languages I (HBHI), pp. 10–19.
ICALPICALP-1972-HarrisonH #product line
On a Family of Deterministic Grammars (MAH, IMH), pp. 413–441.
ICALPICALP-1972-Kuroda #similarity
On Structural Similarity of Phrase-Structure Languages (SYK), pp. 467–474.
STOCSTOC-1972-GarlandL #equivalence
On the Equivalence of Schemes (SJG, DCL), pp. 65–72.
STOCSTOC-1972-Kirkpatrick
On the Additions Necessary to Compute Certain Functions (DGK), pp. 94–101.
SIGMODSIGFIDET-1971-Ferrari #architecture #database
On the Architecture of Data Base Systems (DF), pp. 113–115.
STOCSTOC-1971-Buttelmann #automaton #finite #generative #strict
On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.
STOCSTOC-1971-Chang #parallel
On the Parallel Computation of Local Operations (SKC), pp. 101–115.
SIGMODSIGFIDET-1970-Dennis
On the Exchange of Information (JBD), pp. 41–67.
STOCSTOC-1970-Ausiello #bound
On Bounds on the Number of Steps to Compute Functions (GA), pp. 41–47.
STOCSTOC-1970-Constable #recursion #source code
On the Size of Programs in Subrecursive Formalisms (RLC), pp. 1–9.
STOCSTOC-1970-MartinV #transducer
On Syntax-Directed Transduction and Tree Transducers (DFM, SAV), pp. 129–135.
STOCSTOC-1970-Nivat #product line
On Some Families of Languages Related to the Dyck Language (MN), pp. 221–225.
STOCSTOC-1970-Perrot #automaton #finite #monad
On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.
STOCSTOC-1969-Avizienis #complexity #problem
On the Problem of Computational Time and Complexity of Arithmetic Functions (AA), pp. 255–258.
STOCSTOC-1969-Basu
On Classes of Computable Functions (SKB), pp. 55–59.
STOCSTOC-1969-Blum #algorithm #effectiveness
On Effective Procedures for Speeding Up Algorithms (MB), pp. 43–53.
STOCSTOC-1969-Loveland #complexity #metric
On Minimal-Program Complexity Measures (DWL), pp. 61–65.
STOCSTOC-1969-Spira
On the Computation Time of Certain Classes of Boolean Functions (PMS), pp. 271–272.
DACDAC-1968-Marin #algorithm #logic #strict #synthesis #using
On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits (MAM).
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.